Presentation is loading. Please wait.

Presentation is loading. Please wait.

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

Published bySharlene Malone Modified over 9 years ago

Similar presentations

Presentation on theme: "Autonomous DNA Walking Devices Peng Yin*, Andrew J. Turberfield †, Hao Yan*, John H. Reif* * Department of Computer Science, Duke University † Department."— Presentation transcript:

1 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

2 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

3 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

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

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

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

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

8 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

9 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

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

11 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

12 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

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

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

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

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

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

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

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

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

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

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

23 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

24 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 *

25 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

26 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

27 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

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* A C D A DNA Walker: Operation 28

29 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

30 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

31 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

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* C* A B D A DNA Walker: Operation 32

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* D*A C A B DNA Walker: Operation 33

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* C*D A A B DNA Walker: Operation 34

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* D* A B C A DNA Walker: Operation 35

36 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 37 DNA Walker: Experimental Design

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

39 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.

40 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

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

Similar presentations

Molecular Computing Formal Languages Theory of Codes Combinatorics on Words.

Molecular Computing Formal Languages Theory of Codes Combinatorics on Words.
1 SODA January 23, 2011 Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2D Matthew CookUniversity of Zurich and.

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,

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.

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,

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.

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, 1583-1585 (2006).

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.

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

DNA as a solution of computational problems Radosław Łazarz
Mao, C., LaBean, T.H., Reif, J.H. & Seeman, N.C. (2000), Nature 407, 493-496. A Cumulative XOR Calculation: Assembly.

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, 1203-1207.

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.

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.

 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

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

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

A Framework for Modeling DNA Based Nanorobotical Devices
DNA-Based Programmable Autonomous Molecular Robotic Devices

DNA-Based Programmable Autonomous Molecular Robotic Devices
A Unidirectional DNA Walker Moving Autonomously Along a Track

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.

The Tile Complexity of Linear Assemblies Dept of Computer Science, Duke University Harish Chandran, Nikhil Gopalkrishnan, John Reif { harish, nikhil, reif.

Similar presentations

Ads by Google