DNA Based Self-Assembly and Nano-Device: Theory and Practice Peng Yin Committee Prof. Reif (Advisor), Prof. Agarwal, Prof. Hartemink Prof. LaBean, Prof.

Slides:

Advertisements

Similar presentations

Molecular Computing Formal Languages Theory of Codes Combinatorics on Words.

Advertisements

DNA Self-Assembly For Constructing 3D Boxes Ming-Yang KaoVijay Ramachandran Northwestern UniversityYale University Evanston, IL, USANew Haven, CT, USA.

Active Tile Self Assembly: Daria Karpenko Department of Mathematics and Statistics, University of South Florida Simulating Cellular Automata at Temperature.

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,

A Mechanical Turing Machine: Blueprint for a Biomolecular Computer Udi Shapiro Ehud Shapiro.

Mansi Mavani Graduate Student Department of Physics, OSU Stillwater

1 DNA Computing: Concept and Design Ruoya Wang April 21, 2008 MATH 8803 Final presentation.

DNA as a solution of computational problems Radosław Łazarz

Self-Assembly Ho-Lin Chen Nov Self-Assembly is the process by which simple objects autonomously assemble into complexes. Geometry, dynamics,

Topics in Biological Physics Design and self-assembly of two-dimensional DNA crystals Benny Gil 16/12/08 Fig3.a.

A Mechanical Turing Machine: Blueprint for a Biomolecular Computer

DNA Computing by Self Assembly  Erik Winfree, Caltech.

JSPS Project on Molecular Computing (presentation by Masami Hagiya) funded by Japan Society for Promotion of Science Research for the Future Program –biocomputing.

Mao, C., LaBean, T.H., Reif, J.H. & Seeman, N.C. (2000), Nature 407, A Cumulative XOR Calculation: Assembly.

Ashish Goel Stanford University Joint work with Len Adleman, Holin Chen, Qi Cheng, Ming-Deh Huang, Pablo Moisset, Paul.

How many computers can fit into a drop of water? Udi Shapiro Ehud Shapiro.

1 Programmable Self-Assembled DNA-Based Autonomous Molecular Devices John Reif Duke University DNA Nanostructure Group John H Reif & Thomas H. LaBean Graduate.

DNA-Based Programmable Autonomous Molecular Robotic Devices

A Unidirectional DNA Walker Moving Autonomously Along a Track

Matthew J. Patitz Explorations of Theory and Programming in Self-Assembly Matthew J. Patitz Department of Computer Science University of Texas-Pan American.

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.

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

DNA Self-Assembly for Molecular Patterning, Computation and Robotics John H. Reif Computer Science Department Duke University.

Molecular Computations Using Self-Assembled DNA Nanostructures and Autonomous Motors John H. Reif Department of Computer Science, Duke University 1.

1 Compact Error-Resilient Computational DNA Tiling Assemblies John H.Reif, Sudheer Sahu, and Peng Yin Presenter: Seok, Ho-SIK.

Cellular Automata & DNA Computing 우정철. Definition Of Cellular Automata Von Von Neuman’s Neuman’s Definition Wolfram’s Wolfram’s Definition Lyman.

Algorithmic self-assembly for nano-scale fabrication Erik Winfree Computer Science Computation & Neural Systems and The DNA Caltech DARPA NSF NASA.

Molecular Self-Assembly: Models and Algorithms Ashish Goel Stanford University MS&E 319/CS 369X; Research topics in optimization; Stanford University,

Nanotechnology and Medicine Marisoiu Marius Class XI A Colegiul National “Nicolae Titulescu”’ Pucioasa.

Alan Turing WWII code-breaker mathematical proof of ‘Turing machines’ …in particular, “Universal Turing machine” laid foundations of computer science father.

Powering the nanoworld: DNA-based molecular motors Bernard Yurke A. J. Turberfield University of Oxford J. C. Mitchell University of Oxford A. P. Mills.

4/4/20131 EECS 395/495 Algorithmic DNA Self-Assembly General Introduction Thursday, 4/4/2013 Ming-Yang Kao General Introduction.

Horn Clause Computation by Self-Assembly of DNA Molecules Hiroki Uejima Masami Hagiya Satoshi Kobayashi.

Demonstration of a Universal Surface DNA Computer August 3, 2004 Summarized by Ji-Yoon Park Xingping Su and Lloyd M. Smith* Nucleic Acids Res. 32,

Whiplash PCR History: - Invented by Hagiya et all 1997] - Improved by Erik Winfree Made Isothermal by John Reif and Urmi Majumder 2008 Whiplash.

An Introduction to Algorithmic Tile Self-Assembly.

John Reif and Urmi Majumder Department of Computer Science Duke University Isothermal Reactivating Whiplash PCR for Locally Programmable Molecular Computation.

Computer Theory Michael J. Watts

TileSoft: Sequence Optimization Software for Designing DNA Secondary Structures P. Yin*, B. Guo*, C. Belmore*, W. Palmeri*, E. Winfree †, T. H. LaBean*

Towards Autonomous Molecular Computers Towards Autonomous Molecular Computers Masami Hagiya, Proceedings of GP, Nakjung Choi

Molecular Computation and Splicing Systems J.H.M. Dassen, Summarized by Dongmin Kim

Sudheer Sahu Department of Computer Science, Duke University Advisor: Prof. John Reif Committee: Prof. John Board, Prof. Alex Hartemink, Prof. Thom LaBean,

DNA Enzyme reactions Ligation Restriction enzymes Helicase enzymes Polymerization Strand-displacing polymerases.

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.

Molecular Machine (Jacobson) Group MIT - November 2003 Avogadro Scale Engineering Day 1 - Form ~Getting to the Age of Complexity~

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.

Molecular Algorithms -- Overview

Computational and Experimental Design of DNA Devices

Autonomous DNA Walking Devices

Autonomous Programmable Nanorobotic Devices Using DNAzymes

Introduction to Tiling Assembly

Molecular Computation

Programmable DNA Lattices: Design Synthesis & Applications

Tiing Error Correction & ExperimentsChen

How many computers can fit into a drop of water?

Compact Error Resilient Computational DNA Tiling Assemblies

Autonomous Programmable Nanorobotic Devices Using DNAzymes

Molecular computing: Does DNA compute?

Horn Clause Computation by Self-Assembly of DNA Molecules

JSPS Project on Molecular Computing (presentation by Masami Hagiya)

John H. Reif and Sudheer Sahu

Self-Assembly of Any Shape with

A Unidirectional DNA Walker Moving Autonomously Along a Track

Peng Yin… Presented by Sung-kyu Kim

Sudheer Sahu John H. Reif Duke University

Algorithmic self-assembly with DNA tiles

Lecture One: Automata Theory Amjad Ali

Algorithms for Robust Self-Assembly

Presentation transcript:

DNA Based Self-Assembly and Nano-Device: Theory and Practice Peng Yin Committee Prof. Reif (Advisor), Prof. Agarwal, Prof. Hartemink Prof. LaBean, Prof. Turberfield, Prof. Yan 1

2 There's Plenty of Room at the Bottom Richard P. Feynman, 1959 “…a field, in which little has been done, but in which an enormous amount can be done in principle” Nanofabrication Nanocomputation Nanorobotics Nanodiagnostics/ therapeutics Nanoelectronics Nanoworld (1 m = 10 9 nm)

There's Plenty of Room at the Bottom 3 Nanoworld (1 m = 10 9 nm) ?

There's Plenty of Room at the Bottom 4 How to build things?How to make things move (and do work)? How to compute? Nanoworld (1 m = 10 9 nm)

DNA 101: DNA – Not merely secret to life 5 Self-Assembly ! Information encoding: bases: A, T, C, G Complementarity of bases: A – T; C – G Complementary single strands Duplex 2 nm 3.4 nm

DNA 101: Self-assembly 6 ( Excerpted from Seeman 03 ) Single strand DNA as Smart glues

DNA Based Self-Assembly & Nano-Device: Theory & Practice 7 How to build?How to compute? Self-AssemblyNano-Device Theory & Practice ComputerModelingMathematicalAnalysis How to move? DNA Based Biochem. Lab Fabrication TheoreticalDesign

Roadmap: DNA Based Self-Assembly & Nano-Device 8 Complexity - Error Correction – Nanorobotics - Nanocomputing Complexity of Self-Assembly Nanocomputing Device Nanorobotics Device Error Resilient Self-Assembly

Roadmap: DNA Based Self-Assembly & Nano-Device 9 Complexity Complexity - Error Correction – Nanorobotics - Nanocomputing Complexity of Self-Assembly Nanorobotics Device Nanocomputing Device Error Resilient Self-Assembly

10 Complexity of Graph Self-Assembly in Accretive Systems and Self-Destructible Systems Joint with Reif, Sahu Reif, Sahu, & Yin (2005) Submitted to FNANO 2005 Complexity Complexity - Error Correction – Nanorobotics - Nanocomputing

Accretive Graph Assembly System 11 Graph Weight function Temperature Temperature: τ = 2 Seed vertex Seed vertex Sequentially constructible?

Problems, Results, & Contributions 12 Problems Accretive Graph Assembly Problem Complexity Complexity - Error Correction – Nanorobotics - Nanocomputing Contributions Cooperative effects of attraction and repulsion General setting of graphs Dynamic self-destructible behavior in DGAP model Results AGAP is NP-complete Planar AGAP is NP-complete #AGAP/Stochastic AGAP is #P-complete DGAP is PSPACE-complete Self-Destructible Graph Assembly Prob.

Roadmap: DNA Based Self-Assembly & Nano-Device 13 - Error Correction – Complexity - Error Correction – Nanorobotics – Nanocomputing Complexity of Self-Assembly Nanorobotics Device Nanocomputing Device Error Resilient Self-Assembly

14 Compact Error Resilient Computational DNA Tilings Joint with Reif, Sahu Reif, Sahu, & Yin (2004) DNA 10 - Error Correction – Complexity - Error Correction – Nanorobotics – Nanocomputing

Computational Tilings 15 ( Excerpted from Yan et al 03 ) Tile Computational tiles (Winfree) Input 1 Input 2 Output 1Output 2 Output 1 = Input 1 XOR Input 2 Output 2 = Input 1 AND Input 2 - Error Correction – Complexity - Error Correction – Nanorobotics – Nanocomputing Pad

Binary counter 16 Computational tiles Frame tiles Seed tile - Error Correction – Complexity - Error Correction – Nanorobotics – Nanocomputing Binary counter

Error Error in Assembly 17 Computational tiles Frame tiles Seed tile Error! - Error Correction – Complexity - Error Correction – Nanorobotics – Nanocomputing Binary counter

Error Resilient Tilings by Winfree 18 Error rate    2 Assembly size increased by 4 ( Excerpted from Winfree 03 ) Original tiles: Error resilient tiles: - Error Correction – Complexity - Error Correction – Nanorobotics – Nanocomputing

Compact Error Resilient Computational Tiles 19 Original tiles: Error resilient tiles: XYZ XYYZ - Error Correction – Complexity - Error Correction – Nanorobotics – Nanocomputing

Compact Error Resilient Computational Tiles 20 Original tiles: Error resilient tiles: XYZ XYYZ - Error Correction – Complexity - Error Correction – Nanorobotics – Nanocomputing

Compact Error Resilient Computational Tiles 21 Assembly size not increased Two way overlay: error rate  (5%)   2 (0.25%) Three way overlay: error rate  (5%)   3 (0.0125%) Original tiles: Error resilient tiles: XYZ XYYZ Error checking pads - Error Correction – Complexity - Error Correction – Nanorobotics – Nanocomputing

Computer Simulation (Xgrow, Winfree) 22 - Error Correction – Complexity - Error Correction – Nanorobotics – Nanocomputing Three way overlay Winfree 2x2 construction Two way overlay No error correction Winfree 3x3 construction

Roadmap: DNA Based Self-Assembly & Nano-Device 23 Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing Complexity of Self-Assembly Nanorobotics Device Nanocomputing Device Error Resilient Self-Assembly

Nano-Device 24 An Autonomous Unidirectional DNA Walker Joint with Yan, Daniell, Turberfield, Reif ( R. Cross Lab ) Yin, Yan, Daniell, Turberfield, & Reif (2004) Angew. Chem. Intl. Ed. Yin, Turberfield, & Reif (2004) DNA 10 Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

Autonomous Unidirectional DNA Walker: Design 25 B C D A Track Anchorage A Walker * Ligase PflM I BstAP I Restriction enzymes Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

DNA 101: Enzyme Ligation, Restriction 26 Sticky ends Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing DNA ligase DNA restriction enzyme

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 27 B C D A Track Anchorage A Walker * Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

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 28 Ligase Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

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 29 Ligase Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

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 30 PflM I Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

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 31 Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

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 32 Ligase Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

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 33 Ligase Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

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 34 BstAP I Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

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 35 Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

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 36 Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

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 37 Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

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 38 Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

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 39 Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

40 DNA Walker: Experimental Design Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

41 Autonomous Motion of the Walker Nanorobotics Complexity - Error Correction – Nanorobotics - Nanocomputing

Roadmap: DNA Based Self-Assembly & Nano-Device 42 Nanocomputing Complexity - Error Correction – Nanorobotics - Nanocomputing Complexity of Self-Assembly Nanorobotics Device Nanocomputing Device Error Resilient Self-Assembly

Nano-Device 43 Designs of DNA Cellular Computing Devices Joint with Sahu, Turberfield, Reif Yin, Turberfield, Sahu, & Reif (2004) DNA 10 Yin, Sahu,Turberfield, & Reif (2005) Submitted to DNA 11 Nanocomputing Complexity - Error Correction – Nanorobotics - Nanocomputing

DNA Cellular Computing Devices 44 Self-assemblyNanoroboticsNanocomputation Reusable DNA computers ( Yan et al 03 ) ( Benenson et al 03 ) Complex motion Intelligent robotics devices Nanocomputing Complexity - Error Correction – Nanorobotics - Nanocomputing

DNA Cellular Computing Devices 45 Finite state automataTuring machineCellular automata Nanocomputing Complexity - Error Correction – Nanorobotics - Nanocomputing

Comp 101: Turing Machine 46 Tape Read/write head Transition rule Nanocomputing Complexity - Error Correction – Nanorobotics - Nanocomputing

DNA Turing Machine: Structure 47 Turing machine Transition table: Rule molecules Turing head: Head molecules Data tape: Symbol molecules Autonomous universal DNA Turing machine: 2 states, 5 colors Nanocomputing Complexity - Error Correction – Nanorobotics - Nanocomputing

Turing Machine: Operation 48 Turing machine Nanocomputing Complexity - Error Correction – Nanorobotics - Nanocomputing

Turing Machine: Operation 49 Nanocomputing Complexity - Error Correction – Nanorobotics - Nanocomputing

Turing Machine: Operation 50 Nanocomputing Complexity - Error Correction – Nanorobotics - Nanocomputing

Turing Machine: Operation 51 Nanocomputing Complexity - Error Correction – Nanorobotics - Nanocomputing

Turing Machine: Operation 52 Nanocomputing Complexity - Error Correction – Nanorobotics - Nanocomputing

Turing Machine: Operation 53 Nanocomputing Complexity - Error Correction – Nanorobotics - Nanocomputing

Turing Machine: Operation 54 Nanocomputing Complexity - Error Correction – Nanorobotics - Nanocomputing

Turing Machine: Molecule Set 55 Nanocomputing Complexity - Error Correction – Nanorobotics - Nanocomputing

Turing Machine: Molecule Set/Simulation 56 Nanocomputing Complexity - Error Correction – Nanorobotics - Nanocomputing 2 -Digit Binary Counter

Summary & Future 57 Robotics & Computing Complexity & Fault-Tolerance Complexity - Error Correction – Nanorobotics - Nanocomputing Software Tools: “Molecular compiler” - Rational design & Simulation Summary: Future: Mathematical Theory: General theory & Dynamic behavior Fault-Tolerance: Inspirations from fault tolerance theory & Biological systems Robotics Devices: Robotics lattice & Nanoparticle carrying/(un)loading Computing Devices: In silicon  in vitro  in vivo: “Doctor in a cell”

Summary & Future 58 Robotics & Computing Complexity & Fault-Tolerance Complexity - Error Correction – Nanorobotics - Nanocomputing Software Tools: “Molecular compiler” - Rational design & Simulation Summary: Future: Mathematical Theory: General theory & Dynamic behavior Fault-Tolerance: Fault tolerant theory & Biological inspiration Robotics Devices: Robotics lattice & Nanoparticle carrying/(un)loading Computing Devices: Intelligent robotics lattice & “Doctor in a cell” 58 ? There's Plenty of Room at the Bottom!