Autonomous DNA Walking Devices Peng Yin*, Andrew J. Turberfield †, Hao Yan*, John H. Reif* * Department of Computer Science, Duke University † Department.

Slides:



Advertisements
Similar presentations
Molecular Computing Formal Languages Theory of Codes Combinatorics on Words.
Advertisements

1 SODA January 23, 2011 Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2D Matthew CookUniversity of Zurich and.
Design of a biomolecular Device that executes process Algebra Urmi Majumder and John Reif Department of Computer Science Duke University DNA15, JUNE 10,
Existing “autonomous” system Sakamoto & Hagiya State transitions by molecules A transition table:{S  S’} Starting from the initial state, calculate as.
Session 25 Warm-up 1.Name a segment tangent to circle A. 2.What is the 3.If BD = 36, find BC. 4.If AC = 10 and BD = 24, find AB. 5.If AD = 7 and BD = 24,
A B Q Chord AB is 18. The radius of Circle Q is 15. How far is chord AB from the center of the circle? 9 15 (family!) 12 x.
Two States of the Array B. Ding & N.C. Seeman, Science 314, (2006).
Matthew Mancuso BEE 7600, Professor Dan Luo Department of Biomedical Engineering, Cornell University Presented Thursday February 17 th, 2011 “Give me a.
DNA as a solution of computational problems Radosław Łazarz
Mao, C., LaBean, T.H., Reif, J.H. & Seeman, N.C. (2000), Nature 407, A Cumulative XOR Calculation: Assembly.
The Steps in a Walk Sherman, W.B. & Seeman, N.C. (2004), NanoLett. 4,
How many computers can fit into a drop of water? Udi Shapiro Ehud Shapiro.
 Restriction Enzymes are part of the essential tools of genetic engineering. They have the ability to cut DNA molecules at very precise sequences of.
Relationship between Genotype and Phenotype
1.2 Linear Measure and Precision. Objectives: Measure segments and determine accuracy of measurement. Measure segments and determine accuracy of measurement.
1 Programmable Self-Assembled DNA-Based Autonomous Molecular Devices John Reif Duke University DNA Nanostructure Group John H Reif & Thomas H. LaBean Graduate.
A Framework for Modeling DNA Based Nanorobotical Devices
DNA-Based Programmable Autonomous Molecular Robotic Devices
A Unidirectional DNA Walker Moving Autonomously Along a Track
The Tile Complexity of Linear Assemblies Dept of Computer Science, Duke University Harish Chandran, Nikhil Gopalkrishnan, John Reif { harish, nikhil, reif.
Genomic walking (1) To start, you need: -the DNA sequence of a small region of the chromosome -An adaptor: a small piece of DNA, nucleotides long.
Autonomous DNA Nanomechanical Device Capable of Universal Computation and Universal Translational Motion Peng Yin*, Andrew J. Turberfield †, Sudheer Sahu*,
The Design of Autonomous DNA Nanomechanical Devices: Walking and Rolling John H. Reif Duke University.
The Plasmid Lab: Creating Recombinant DNA.  Circular piece of DNA  Replicates independently  Used as a VECTOR.
DNA Based Self-Assembly and Nano-Device: Theory and Practice Peng Yin Committee Prof. Reif (Advisor), Prof. Agarwal, Prof. Hartemink Prof. LaBean, Prof.
DNA Self-Assembly for Molecular Patterning, Computation and Robotics John H. Reif Computer Science Department Duke University.
The Design of Autonomous DNA Nanomechanical Devices: Walking and Rolling DNA John Reif John Reif.
Molecular Computations Using Self-Assembled DNA Nanostructures and Autonomous Motors John H. Reif Department of Computer Science, Duke University 1.
Virginia iGEM Workshop #3 High School Education Series.
Class Notes 1: DNA Manipulation. I. DNA manipulation A. During recent years, scientists have developed a technique to manipulate DNA, enabling them to.
Biotech Lab #1 -Extraction Extract DNA from an organism’s cell to get the GOI – gene of interest.
Algorithmic self-assembly for nano-scale fabrication Erik Winfree Computer Science Computation & Neural Systems and The DNA Caltech DARPA NSF NASA.
Powering the nanoworld: DNA-based molecular motors Bernard Yurke A. J. Turberfield University of Oxford J. C. Mitchell University of Oxford A. P. Mills.
Right-Angled Trigonometry Involving 3D Example The cuboid below has length AB = 4cm, DE = 6cm and AF = 12cm. Work out the lengths of the diagonals (i)
4/4/20131 EECS 395/495 Algorithmic DNA Self-Assembly General Introduction Thursday, 4/4/2013 Ming-Yang Kao General Introduction.
Whiplash PCR History: - Invented by Hagiya et all 1997] - Improved by Erik Winfree Made Isothermal by John Reif and Urmi Majumder 2008 Whiplash.
John Reif and Urmi Majumder Department of Computer Science Duke University Isothermal Reactivating Whiplash PCR for Locally Programmable Molecular Computation.
Determine the sequence of genes along a chromosome based on the following recombination frequencies A-C 20% A-D 10% B-C 15% B-D 5%
Sudheer Sahu Department of Computer Science, Duke University Advisor: Prof. John Reif Committee: Prof. John Board, Prof. Alex Hartemink, Prof. Thom LaBean,
By Irma Crespo Formal Proof. The Formal Proof A formal proof of a sentence is a sequence of statements wherein each statement follows the form of the.
DNA Enzyme reactions Ligation Restriction enzymes Helicase enzymes Polymerization Strand-displacing polymerases.
Session 25 Warm-up 1.Name a segment tangent to circle A. 2.What is the 3.If BD = 36, find BC. 4.If AC = 10 and BD = 24, find AB. 5.If AD = 7 and BD = 24,
Palindrome, Restriction Enzyme, Sticky Ends GAATTC G AATTC G Sticky Ends (Cohesive Ends) EcoRI CIVIC, Madam Get An Apple To The Class G AATTCG Arber, Nathans,
Biomolecular Implementation of Computing Devices with Unbounded Memory Matteo CAVALIERE, Nataša JONOSKA, Nadrian C. SEEMAN. Department of Computer Science.
南亚和印度.
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.
Complexity of Graph Self-Assembly in Accretive Systems and Self-Destructible Systems Peng Yin Joint with John H. Reif and Sudheer Sahu 1 Department of.
Non-Autonomous DNA based Nanorobotical devices
Autonomous DNA Walking Devices
Autonomous Programmable Nanorobotic Devices Using DNAzymes
Extensions and Restrictions of Turing Machines
Turing Machine
Aim: Full House Grid: 9 Grid Play: Calculate answer & cross it off
B-Z Device Chengde Mao. B-Z Device Chengde Mao.
Molecular Computation
2. Definition of congruent segments AB = CD 2.
تصنيف التفاعلات الكيميائية
How many computers can fit into a drop of water?
Compact Error Resilient Computational DNA Tiling Assemblies
Autonomous Programmable Nanorobotic Devices Using DNAzymes
The Off-Line Machine Input File read-only (once) Input string
Molecular computing: Does DNA compute?
Horn Clause Computation by Self-Assembly of DNA Molecules
John H. Reif and Sudheer Sahu
A Unidirectional DNA Walker Moving Autonomously Along a Track
‘A stimuli responsive DNA walking device’
Peng Yin… Presented by Sung-kyu Kim
Tamar Ratner, Ron Piran, Natasha Jonoska, Ehud Keinan 
Mean angular positions of the (A,C) head (triangles) and (B,D) trunk (circles) segments in the pitch plane during walks and gallops by (A,B) hanumans and.
Designs for Autonomous Unidirectional Walking DNA Devices
Presentation transcript:

Autonomous DNA Walking Devices Peng Yin*, Andrew J. Turberfield †, Hao Yan*, John H. Reif* * Department of Computer Science, Duke University † Department of Physics, Clarendon Laboratory, University of Oxford 1

Motivation 2 DNA based nanorobotics devices ( Mao et al 99 )( Yurke et al 00 )( Simmel et al 01 )( Simmel et al 02 ) ( Yan et al 02 )( Li et al 02 )( Alberti et al 03 )( Feng et al 03 ) Rotation Open/close Extension/contraction Motivation Motivation-Device I-Device II-Device III-Conclusion

Motivation 3 DNA nanorobotics ( R. Cross Lab ) Kinesin Synthetic unidirectional DNA walker that moves autonomously along a linear route over a macroscopic structure ? (Recent work: non-autonomous DNA walking device by Seeman’s group, autonomous DNA tweezer by Mao’s group) Rotation, open/close extension/contraction mediated by environmental changes Autonomous, unidirectional motion along an extended linear track Motivation Motivation-Device I-Device II-Device III-Conclusion

DNA 101: Enzyme Ligation, Restriction 4 Sticky ends DNA ligase DNA restriction enzyme Motivation Motivation-Device I-Device II-Device III-Conclusion

DNA 101: Enzyme Ligation, Restriction 5 Sticky ends DNA ligase DNA restriction enzyme Motivation Motivation-Device I-Device II-Device III-Conclusion

DNA 101: Enzyme Ligation, Restriction 6 Sticky ends DNA ligase DNA restriction enzyme Motivation Motivation-Device I-Device II-Device III-Conclusion

Device I: Structural overview 7 Device I Motivation-Device I-Device II-Device III-Conclusion

Device I: Operation 8 Device I Motivation-Device I-Device II-Device III-Conclusion Valid hybridization: A + C* => A*C B* + C => B*C A* + D => A*D B + D* => B*D Valid cut: A*C => A* + CB*C => B + C* A*D => A + D*B*D => B* + D

Device I: Operation 9 Device I Motivation-Device I-Device II-Device III-Conclusion Valid hybridization: A + C* => A*C B* + C => B*C A* + D => A*D B + D* => B*D Valid cut: A*C => A* + CB*C => B + C* A*D => A + D*B*D => B* + D

Device I: Operation 10 Device I Motivation-Device I-Device II-Device III-Conclusion

Device I: Operation 11 Device I Motivation-Device I-Device II-Device III-Conclusion Valid hybridization: A + C* => A*C B* + C => B*C A* + D => A*D B + D* => B*D Valid cut: A*C => A* + CB*C => B + C* A*D => A + D*B*D => B* + D

Device I: Operation 12 Device I Motivation-Device I-Device II-Device III-Conclusion Valid hybridization: A + C* => A*C B* + C => B*C A* + D => A*D B + D* => B*D Valid cut: A*C => A* + CB*C => B + C* A*D => A + D*B*D => B* + D

Device I: Operation 13 Device I Motivation-Device I-Device II-Device III-Conclusion

Device I: Operation 14 Device I Motivation-Device I-Device II-Device III-Conclusion

Device I: Nanowheel 15 Device I Motivation-Device I-Device II-Device III-Conclusion

Device I: Dual Nanowheel 16 Device I Motivation-Device I-Device II-Device III-Conclusion

Device II: Structure overview 17 Device II Motivation-Device I-Device II-Device III-Conclusion

Device II: Operation 18 Device II Motivation-Device I-Device II-Device III-Conclusion

Device II: Operation 19 Device II Motivation-Device I-Device II-Device III-Conclusion

Device II: Operation 20 Device II Motivation-Device I-Device II-Device III-Conclusion

Device II: Operation 21 Device II Motivation-Device I-Device II-Device III-Conclusion

Device II: Operation 22 Device II Motivation-Device I-Device II-Device III-Conclusion

Design III: Structure overview 23 B C D A Track Anchorage A Walker * Ligase PflM I BstAP I Restriction enzymes Device III Motivation-Device I-Device II-Device III-Conclusion

Valid hybridization: A* + B = A + B* => A*B B* + C = B + C* => B*C C* + D = C + D* => C*D D* + A = D + A* => D*A Valid cut: A*B => A + B*B*C => B + C* C*D => C + D*D*A => D + A* DNA Walker: Operation 24 B C D A Track Anchorage A Walker *

Valid hybridization: A* + B = A + B* => A*B B* + C = B + C* => B*C C* + D = C + D* => C*D D* + A = D + A* => D*A Valid cut: A*B => A + B*B*C => B + C* C*D => C + D*D*A => D + A* A*B A C D DNA Walker: Operation 25 Ligase

Valid hybridization: A* + B = A + B* => A*B B* + C = B + C* => B*C C* + D = C + D* => C*D D* + A = D + A* => D*A Valid cut: A*B => A + B*B*C => B + C* C*D => C + D*D*A => D + A* A*B A C D DNA Walker: Operation 26 Ligase

Valid hybridization: A* + B = A + B* => A*B B* + C = B + C* => B*C C* + D = C + D* => C*D D* + A = D + A* => D*A Valid cut: A*B => A + B*B*C => B + C* C*D => C + D*D*A => D + A* A*B A C D DNA Walker: Operation 27 PflM I

Valid hybridization: A* + B = A + B* => A*B B* + C = B + C* => B*C C* + D = C + D* => C*D D* + A = D + A* => D*A Valid cut: A*B => A + B*B*C => B + C* C*D => C + D*D*A => D + A* B* A C D A DNA Walker: Operation 28

Valid hybridization: A* + B = A + B* => A*B B* + C = B + C* => B*C C* + D = C + D* => C*D D* + A = D + A* => D*A Valid cut: A*B => A + B*B*C => B + C* C*D => C + D*D*A => D + A* B*C A A D DNA Walker: Operation 29 Ligase

Valid hybridization: A* + B = A + B* => A*B B* + C = B + C* => B*C C* + D = C + D* => C*D D* + A = D + A* => D*A Valid cut: A*B => A + B*B*C => B + C* C*D => C + D*D*A => D + A* B*C A A D DNA Walker: Operation 30 Ligase

Valid hybridization: A* + B = A + B* => A*B B* + C = B + C* => B*C C* + D = C + D* => C*D D* + A = D + A* => D*A Valid cut: A*B => A + B*B*C => B + C* C*D => C + D*D*A => D + A* B*C A A D DNA Walker: Operation 31 BstAP I

Valid hybridization: A* + B = A + B* => A*B B* + C = B + C* => B*C C* + D = C + D* => C*D D* + A = D + A* => D*A Valid cut: A*B => A + B*B*C => B + C* C*D => C + D*D*A => D + A* C* A B D A DNA Walker: Operation 32

Valid hybridization: A* + B = A + B* => A*B B* + C = B + C* => B*C C* + D = C + D* => C*D D* + A = D + A* => D*A Valid cut: A*B => A + B*B*C => B + C* C*D => C + D*D*A => D + A* D*A C A B DNA Walker: Operation 33

Valid hybridization: A* + B = A + B* => A*B B* + C = B + C* => B*C C* + D = C + D* => C*D D* + A = D + A* => D*A Valid cut: A*B => A + B*B*C => B + C* C*D => C + D*D*A => D + A* C*D A A B DNA Walker: Operation 34

Valid hybridization: A* + B = A + B* => A*B B* + C = B + C* => B*C C* + D = C + D* => C*D D* + A = D + A* => D*A Valid cut: A*B => A + B*B*C => B + C* C*D => C + D*D*A => D + A* D* A B C A DNA Walker: Operation 35

Valid hybridization: A* + B = A + B* => A*B B* + C = B + C* => B*C C* + D = C + D* => C*D D* + A = D + A* => D*A Valid cut: A*B => A + B*B*C => B + C* C*D => C + D*D*A => D + A* A* A B C D DNA Walker: Operation 36

37 DNA Walker: Experimental Design

38 Autonomous Motion of the Walker For more detail, see our poster.

DNA Turing Machine: Structure 39 Turing machine Transitional rules: Rule molecules Turing head: Head molecules Data tape: Symbol molecules Autonomous universal DNA Turing machine: 2 states, 5 colors For more detail, see our poster.

Acknowledgement 40 Duke CS DNA Nano Group Peng Yin Hao Yan Xiaoju G. Daniell Thomas H. LaBean Sung Ha Park Sang Jung Ahn Hanying Li Liping Feng Sudheer Sahu Funding NSF, DARPA grants to John H. Reif NSF grant to Hao Yan Physics, University of Oxford Andrew J. Turberfield Andrew J. Turberfield