Compact Error Resilient Computational DNA Tiling Assemblies

Slides:

Advertisements

Similar presentations

Ashish Goel, 1 A simple analysis Suppose complementary DNA strands of length U always stick, and those of length L never stick (eg:

Advertisements

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

Tile Complexity of Assembly of Fixed Size Rows and Squares by John Reif and Harish Chandran.

Strict Self-Assembly of Discrete Sierpinski Triangles James I. Lathrop, Jack H. Lutz, and Scott M. Summers Iowa State University © James I. Lathrop, Jack.

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

Self-Assembly with Geometric Tiles ICALP 2012 Bin FuUniversity of Texas – Pan American Matt PatitzUniversity of Arkansas Robert Schweller (Speaker)University.

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,

The Power of Seeds in Tile Self-Assembly Andrew Winslow Department of Computer Science, Tufts University.

Design of a Minimal System for Self-replication of Rectangular Patterns of DNA Tiles Vinay K Gautam 1, Eugen Czeizler 2, Pauline C Haddow 1 and Martin.

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

DNA Computing by Self Assembly  Erik Winfree, Caltech.

1 Resolution loss Error-correcting schemes mentioned above always generates a resolution loss. Compact proofreading [Sahu, Reif, Yin ’04] is proposed to.

Robust Self-Assembly of DNA Eduardo Abeliuk Dept. of Electrical Engineering Stanford University November 30, 2006.

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

3.1 Addition Property of Equality (APE). The Addition Property of Equality Rule: if a = b, then a + c = b + c Another Version of the Rule: If a=b, then.

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

A Unidirectional DNA Walker Moving Autonomously Along a Track

 Polynomials Lesson 5 Factoring Special Polynomials.

1 Proceedings of the 24 th Annual ACM-SIAM Symposium on Discrete Algorithms January, 2013 Fuel Efficient Computation in Passive Self-Assembly Robert SchwellerUniversity.

Autonomous DNA Nanomechanical Device Capable of Universal Computation and Universal Translational Motion Peng Yin*, Andrew J. Turberfield †, Sudheer Sahu*,

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

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

Computer Programmer. 3 Tasks that are performed Write, update, and maintain computer programs or software tasks Correct computer program errors Test programs.

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.

Notes on the optimal encoding scheme for self-assembly Days 10, 11 and 12 Of Comp Sci 480.

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

IB Computer Science – Logic

Chapter 9 - Transformations. 90 degree rotation (x 1, y 1 ) 180 degree rotation (x 2, y 2 ) 270 degree rotation (x 3, y 3 )

An Introduction to Algorithmic Tile Self-Assembly.

JOHN DOE PERIOD 8. AT LEAST 80% OF HUMANITY LIVES ON LESS THAN $10 A DAY.

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

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

Notes for temperature 1 self- assembly Days 15, 16, 17 and 18 of Comp Sci 480.

Ashish Goel, 1 The Source of Errors: Thermodynamics Rate of correct growth ¼ exp(-G A ) Probability of incorrect growth ¼ exp(-G A.

1 David DotyCalifornia Institute of Technology Matthew J. PatitzUniversity of Texas Pan-American Dustin ReishusUniversity of Southern California Robert.

Can a and b both be whole numbers? similar triangles so.

1 Web Search What does the term “binary” mean in a general sense? What does the prefix “bi” tell us? 2 Web Search What does the term “binary”

1 35 th International Colloquium on Automata, Languages and Programming July 8, 2008 Randomized Self-Assembly for Approximate Shapes Robert Schweller University.

DNA Bricks Ke, Y., Ong, L. L., Shih, W. M. & Yin, P. Three-dimensional structures self- assembled from DNA bricks. Science 338, 1177–1183 (2012).

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.

Proof And Strategies Chapter 2. Lecturer: Amani Mahajoub Omer Department of Computer Science and Software Engineering Discrete Structures Definition Discrete.

Staged Self-Assembly and Polyomino Context-Free Grammars

Self-Assembly at Temperature 1

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

Computational and Experimental Design of DNA Devices

Autonomous DNA Walking Devices

Error Correcting Code.

Autonomous Programmable Nanorobotic Devices Using DNAzymes

Introduction to Tiling Assembly

Molecular Computation

Programmable DNA Lattices: Design Synthesis & Applications

Day 4- Number Systems & Binary Numbers

Day 4- Number Systems & Binary Numbers

Tiing Error Correction & ExperimentsChen

DNA Self-Assembly Robert Schweller Northwestern University

Physics-based simulation for visual computing applications

Autonomous Programmable Nanorobotic Devices Using DNAzymes

Strict Self-Assembly of Discrete Sierpinski Triangles

Horn Clause Computation by Self-Assembly of DNA Molecules

Self-Assembly Ho-Lin Chen Nov

John H. Reif and Sudheer Sahu

Self-Assembly of Any Shape with

DNA Hybridization Catalysts and Catalyst Circuits

A Unidirectional DNA Walker Moving Autonomously Along a Track

Sudheer Sahu John H. Reif Duke University

Algorithmic self-assembly with DNA tiles

Algorithms for Robust Self-Assembly

Finite Field Arithmetic using Self-Assembly of DNA Tilings

Presentation transcript:

Compact Error Resilient Computational DNA Tiling Assemblies John Reif, Sudheer Sahu, Peng Yin Department of Computer Science, Duke University

Self-Assembly of DNA Tiles 2 Self-Assembly of DNA Tiles Perform universal computation. Manufacture patterned nanostructures from smaller unit nanostructures.

Assembly of Binary Counter (Winfree) Computational tiles Seed tile Frame tiles Binary counter

Errors in Self-Assembly of DNA Tiles Binding rules are not strict. A tile might get assembled to a binding site where it was not supposed to go.

Example of a Computational Error Computational tiles Seed tile Error! Frame tiles

How to Decrease Errors? Errors can be arbitrarily decreased by Decreasing concentration of tiles. Increasing binding strengths. Drawback : Reduce speed. Another approach: Change the logical design of the tiles.

(Excerpted from Winfree 03) Error Resilient Tilings by Winfree Original tiles: Error resilient tiles: (Excerpted from Winfree 03) Error rate  => 2 Assembly size increased by 4

Original tiles: A B C AB BC Error resilient tiles:

Original tiles: A B C AB BC Error resilient tiles:

Original tiles: A B C AB BC Error resilient tiles: Error checking pads

A Computational Tile

Compact Error Resilient Construction Wholeness of pad: Single pad per side.

One Mismatch causes more Mismatch Case 1

One Mismatch causes more Mismatch Case 2

One Mismatch causes more Mismatch Case 3

One Mismatch causes more Mismatch Case 4

Result of Compact Error Resilient Scheme We saw: Two way overlay scheme. One mismatch caused at least one more mismatch. Error is reduced from  to 2. Next we will see: Three way overlay scheme. One mismatch will cause at least two more mismatches. Error will reduce from  to 3.

Compact Error Resilient Tiles (3-way overlay) Reduce Error from  to 3

Examples of Error Resilient Assembly

Examples of Error Resilient Assembly

Computer Simulation (Xgrow, Winfree) Three way overlay Winfree 3x3 construction Winfree 2x2 construction Two way overlay No error correction

Conclusions Assembly size not increased. Two way overlay: error rate (5%) => 2(0.25%). Three way overlay: error rate  (5%) => 3 (0.0125%). Open question: error rate  => k ?