Molecular computing: Does DNA compute?

Slides:



Advertisements
Similar presentations
Solving Hamiltonian Path Problems with a DNA Computer Brad Isom, Zach Caton, Cody Matheny, Cody Barta, Brandin Erickson, David Carr.
Advertisements

DNA Computation Hiroshi Higuchi.
P449. p450 Figure 15-1 p451 Figure 15-2 p453 Figure 15-2a p453.
1 DNA Computing: Concept and Design Ruoya Wang April 21, 2008 MATH 8803 Final presentation.
Montek Singh COMP Nov 15,  Two different technologies ◦ TODAY: DNA as biochemical computer  DNA molecules encode data  enzymes, probes.
Homework #9 Solutions.
Fall 2004COMP 3351 Time Complexity We use a multitape Turing machine We count the number of steps until a string is accepted We use the O(k) notation.
Figure Figure 18-1 part 1 Figure 18-1 part 2.
Presented By:- Anil Kumar MNW-882-2K11
Biotech Lab#2 DNA Scissors Extract DNA from cell Magnify a portion of DNA & it looks like this: Double Helix Magnify a portion of Double Helix & it looks.
Recombinant DNA and Biotechnology Gene cloning in bacterial plasmids Plasmid – extrachromosomal piece of DNA not necessary for survival can be transferred.
1 Computing with DNA L. Adelman, Scientific American, pp (Aug 1998) Note: This ppt file is based on a student presentation given in October, 1999.
DNA Based Self-Assembly and Nano-Device: Theory and Practice Peng Yin Committee Prof. Reif (Advisor), Prof. Agarwal, Prof. Hartemink Prof. LaBean, Prof.
BY CLAYTON PETTY Leonard Max Adleman. Background Born Dec. 31, 1945 in California Attended UC Berkeley  BA in Mathematics in 1968  Ph.D. in EECS in.
What is DNA Computing? Shin, Soo-Yong Artificial Intelligence Lab.
Computation through DNA Jason Meador GST 400 – What is Thought? April 24, 2006.
DNA computing on a chip Mitsunori Ogihara and Animesh Ray Nature, 2000 발표자 : 임예니.
1 Biological Computing – DNA solution Presented by Wooyoung Kim 4/8/09 CSc 8530 Parallel Algorithms, Spring 2009 Dr. Sushil K. Prasad.
Towards Autonomous Molecular Computers Towards Autonomous Molecular Computers Masami Hagiya, Proceedings of GP, Nakjung Choi
1 Time Complexity We use a multitape Turing machine We count the number of steps until a string is accepted We use the O(k) notation.
Computation by Self-assembly of DNA Graphs N. Jonoska, P. Sa-Ardyen, and N. Seeman Genetic Programming and Evolvable Machines, v.4, pp , 2003 Summarized.
Double Helix Molecular Structure Helix unwound purine pyrimidine DNA Structure Unit II animationanimation.
Chapters 11 and 12 Decision Problems and Undecidability.
A PRESENTATION ON DNA COMPUTING Presented By SOMYA JAIN.
Topics to be covers Basic features present on plasmids
DO Now Identify the circled structure.
Turing Machines.
Extensions and Restrictions of Turing Machines
Turing Machine
Volume 8, Issue 9, Pages R177-R185 (September 2000)
Repair of mtDNA in Vertebrates
Genetic Engineering تقنيات الهندسة الوراثية
Genome-editing Technologies for Gene and Cell Therapy
DNA STRUCTURE Topic 3.3 IB Biology Miss Werba.
CoSMoS Unravels Mysteries of Transcription Initiation
Computational Complexity
Loading Rho to Terminate Transcription
RNA world: Catalysis abets binding, but not vice versa
A Universal Turing Machine
Time Complexity We use a multitape Turing machine
Adding Specificity to Artificial Transcription Activators
Bacterial genomics: The controlled chaos of shifty pathogens
GENETIC ENGINEERING Human Cell DNA 1 Isolation
DO Now Identify the circled structure.
X-Inactivation: Xist RNA Uses Chromosome Contacts to Coat the X
The Architecture of Restriction Enzymes
Theory of Computability
DNA-Cation Interactions
Cytoskeleton: Titin as a scaffold and spring
Peng Yin… Presented by Sung-kyu Kim
The Path of Messenger RNA through the Ribosome
Tamar Ratner, Ron Piran, Natasha Jonoska, Ehud Keinan 
Genome-editing Technologies for Gene and Cell Therapy
Acrosomal Actin: Twists and Turns of a Versatile Filament
Melissa S Jurica, Raymond J Monnat, Barry L Stoddard  Molecular Cell 
Volume 60, Issue 3, Pages (November 2015)
Bivalent Aptamers Deliver the Punch
DNA Solution of the Maximal Clique Problem
DNA repair: Rad52 – the means to an end
Redesigning the Architecture of the Base Pair: Toward Biochemical and Biological Function of New Genetic Sets  Andrew T. Krueger, Eric T. Kool  Chemistry.
Biology DNA HOMEWORK! Name: _____________
Reflections on a Novel Therapeutic Candidate
Keep the motor running Current Biology
Volume 7, Issue 6, Pages R147-R151 (June 2000)
Polq-Mediated End Joining Is Essential for Surviving DNA Double-Strand Breaks during Early Zebrafish Development  Summer B. Thyme, Alexander F. Schier 
Theory of Computability
Daniel L. Kaplan, Mike O'Donnell  Molecular Cell 
At the Crossroads of Chemistry, Biology, and Materials
DNA topology: Topoisomerases keep it simple
Figure 5-1 Molecular Biology of the Cell (© Garland Science 2008)
Presentation transcript:

Molecular computing: Does DNA compute? Daniel E. Rozen, Steve McGrew, Andrew D. Ellington  Current Biology  Volume 6, Issue 3, Pages 254-257 (March 1996) DOI: 10.1016/S0960-9822(02)00471-2

Figure 1 The diagram represents a directed Hamiltonian path problem similar to the one solved by Adleman [1]. Of the many possible routes between each of the nodes, starting at 0 and ending at 6, the only one that correctly solves the Hamiltonian path problem is: 0→1→2→3→4→5→6. Adleman encoded the routes between cities/nodes as random oligomers and encoded the cities/nodes themselves as the 3′ complement of half of one route and the 5′ complement of half of the next route. The routes (shown in deep blue) are splinted together by the node (in lighter blue) that represents node 4. Such splinting through the entire graph allows a double stranded DNA encoding of the correct solution to the Hamiltonian path problem. Current Biology 1996 6, 254-257DOI: (10.1016/S0960-9822(02)00471-2)

Figure 2 (a) A Turing machine, showing its three main features: an information tape, a machine head that reads the tape, and a table that determines the action of the machine head according to its state and the information on the tape. (b) A Turing machine implemented in DNA. Specific restriction sites surround a binary encoded oligomer that can be removed with appropriate restriction enzymes and then replaced with a segment bearing complementary sticky ends and an altered interior binary unit. Current Biology 1996 6, 254-257DOI: (10.1016/S0960-9822(02)00471-2)

Figure 2 (a) A Turing machine, showing its three main features: an information tape, a machine head that reads the tape, and a table that determines the action of the machine head according to its state and the information on the tape. (b) A Turing machine implemented in DNA. Specific restriction sites surround a binary encoded oligomer that can be removed with appropriate restriction enzymes and then replaced with a segment bearing complementary sticky ends and an altered interior binary unit. Current Biology 1996 6, 254-257DOI: (10.1016/S0960-9822(02)00471-2)