1 / 14

Demonstration of a universal surface DNA computer

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 Rhee. Introduction.

carver
Download Presentation

Demonstration of a universal surface DNA computer

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  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 Rhee

  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.

  3. Computational complexity classes

  4. A circuit consisting of a NOR gate andan OR gate For simplicity, this circuit had only two inputs to each gate and had three initial input variables. Truth table and an equivalent circuit to the one in (a)

  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 fixed label, F4, at either end. • These DNA oligonucleotides were attached to the surface through the thiol group at their 3’end.

  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.

  7. Computation of a simple circuit consisting of a NOR gate and an OR gate.

  8. Computation of a simple circuit consisting of a NOR gate and an OR gate.

  9. A circuit when the two input words are non-contiguous Contiguous Non-contiguous The two input words are next to each other The two input words are non-contiguous

  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.

  11. Computation when the two inputs to a gate are non-contiguous

  12. Results from the circuit computations After NOR gate After OR gate TRUE FALSE TRUE FALSE The program NIH Image (http://rsb.info.nih.gov/nih-image/) was used to process these fluorescence images for presentation

  13. Results from the circuit computations The truth-table for the circuit in both the contiguous and non-contiguous cases DNA oligonucleotides A-H were attached to the gold slide surfaces in an ‘addressed’ fashion

  14. The overall computational efficiency Background-corrected fluorescence intensities of the complements to the third word and the correctly appended fourth and fifth words. Efficiencies of the NOR gate, OR gate and the overall computation

More Related