Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, 3115-3123...
-
Upload
emma-violet-sullivan -
Category
Documents
-
view
222 -
download
0
description
Transcript of Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, 3115-3123...
![Page 1: Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, 3115-3123 Xingping Su and Lloyd M. Smith Presented by Je-Keun.](https://reader035.fdocuments.net/reader035/viewer/2022062223/5a4d1b6e7f8b9ab0599b42fe/html5/thumbnails/1.jpg)
Demonstration of a universal Demonstration of a universal surface DNA computersurface DNA computer
Nucleic Acids Research, 2004, Vol. 32, 3115-3123
Xingping Su and Lloyd M. Smith
Presented by Je-Keun Rhee
![Page 2: Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, 3115-3123 Xingping Su and Lloyd M. Smith Presented by Je-Keun.](https://reader035.fdocuments.net/reader035/viewer/2022062223/5a4d1b6e7f8b9ab0599b42fe/html5/thumbnails/2.jpg)
2
Introduction
A fundamental concept in computer science is that of the universal Turing machine, which is an abstract definition of a general purpose computer.
A general purpose (universal) computer is defined as one which can compute anything that is computable.
It has been shown that any computer which is able to simulate Boolean logic circuits of any complexity is such a general purpose computer.
In this study, it is shown that a NOR gate can be built based on the surface computing model.
![Page 3: Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, 3115-3123 Xingping Su and Lloyd M. Smith Presented by Je-Keun.](https://reader035.fdocuments.net/reader035/viewer/2022062223/5a4d1b6e7f8b9ab0599b42fe/html5/thumbnails/3.jpg)
3
Computational complexity classes
![Page 4: Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, 3115-3123 Xingping Su and Lloyd M. Smith Presented by Je-Keun.](https://reader035.fdocuments.net/reader035/viewer/2022062223/5a4d1b6e7f8b9ab0599b42fe/html5/thumbnails/4.jpg)
4
A circuit consisting of a NOR gate andan OR gate
For simplicity, this circuit had only two inputs to each gateand had three initial input variables.
Truth table and an equivalent circuit to the one in (a)
![Page 5: Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, 3115-3123 Xingping Su and Lloyd M. Smith Presented by Je-Keun.](https://reader035.fdocuments.net/reader035/viewer/2022062223/5a4d1b6e7f8b9ab0599b42fe/html5/thumbnails/5.jpg)
5
Sequences (5’->3’) of the DNA encoding the inputs Three 16nt words encoded three bits of information: X1, X2, and X3. Each word was made up of an 8 nt encoding region, v8, and a 4 nt word fix
ed label, F4, at either end. These DNA oligonucleotides were attached to the surface through the thiol
group at their 3’end.
![Page 6: Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, 3115-3123 Xingping Su and Lloyd M. Smith Presented by Je-Keun.](https://reader035.fdocuments.net/reader035/viewer/2022062223/5a4d1b6e7f8b9ab0599b42fe/html5/thumbnails/6.jpg)
6
Sequences of the words and word complements
Sequences of the words (5’->3’)
Sequences of the words complements (5’->3’)
The design tool at the Proligo website (http://www.proligo.com) were used.
![Page 7: Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, 3115-3123 Xingping Su and Lloyd M. Smith Presented by Je-Keun.](https://reader035.fdocuments.net/reader035/viewer/2022062223/5a4d1b6e7f8b9ab0599b42fe/html5/thumbnails/7.jpg)
7
Computation of a simple circuit consisting of a NOR gate and an OR gate.
![Page 8: Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, 3115-3123 Xingping Su and Lloyd M. Smith Presented by Je-Keun.](https://reader035.fdocuments.net/reader035/viewer/2022062223/5a4d1b6e7f8b9ab0599b42fe/html5/thumbnails/8.jpg)
8
Computation of a simple circuit consisting of a NOR gate and an OR gate.
![Page 9: Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, 3115-3123 Xingping Su and Lloyd M. Smith Presented by Je-Keun.](https://reader035.fdocuments.net/reader035/viewer/2022062223/5a4d1b6e7f8b9ab0599b42fe/html5/thumbnails/9.jpg)
9
A circuit when the two input words are non-contiguous
Contiguous Non-contiguousThe two input words are non-contiguousThe two input words are
next to each other
![Page 10: Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, 3115-3123 Xingping Su and Lloyd M. Smith Presented by Je-Keun.](https://reader035.fdocuments.net/reader035/viewer/2022062223/5a4d1b6e7f8b9ab0599b42fe/html5/thumbnails/10.jpg)
10
LNA (locked nucleic acids)
In non-contiguous case, LNA/DNA chimeras were hybridized. Such LNA/DNA chimeras were used to block the polymerase
extension reaction.
![Page 11: Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, 3115-3123 Xingping Su and Lloyd M. Smith Presented by Je-Keun.](https://reader035.fdocuments.net/reader035/viewer/2022062223/5a4d1b6e7f8b9ab0599b42fe/html5/thumbnails/11.jpg)
11
Computation when the two inputs to a gate are non-contiguous
![Page 12: Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, 3115-3123 Xingping Su and Lloyd M. Smith Presented by Je-Keun.](https://reader035.fdocuments.net/reader035/viewer/2022062223/5a4d1b6e7f8b9ab0599b42fe/html5/thumbnails/12.jpg)
12
Results from the circuit computations
After NOR gate After OR gateTRUE FALSE TRUE FALSE
The program NIH Image (http://rsb.info.nih.gov/nih-image/) was used to processthese fluorescence images for presentation
![Page 13: Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, 3115-3123 Xingping Su and Lloyd M. Smith Presented by Je-Keun.](https://reader035.fdocuments.net/reader035/viewer/2022062223/5a4d1b6e7f8b9ab0599b42fe/html5/thumbnails/13.jpg)
13
Results from the circuit computations
The truth-table for the circuitin both the contiguous andnon-contiguous cases
DNA oligonucleotides A-H wereattached to the gold slide surfacesin an ‘addressed’ fashion
![Page 14: Demonstration of a universal surface DNA computer Nucleic Acids Research, 2004, Vol. 32, 3115-3123 Xingping Su and Lloyd M. Smith Presented by Je-Keun.](https://reader035.fdocuments.net/reader035/viewer/2022062223/5a4d1b6e7f8b9ab0599b42fe/html5/thumbnails/14.jpg)
14
The overall computational efficiency
Background-corrected fluorescence intensitiesof the complements to the third word and thecorrectly appended fourth and fifth words.
Efficiencies of the NOR gate, OR gate andthe overall computation