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

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

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.
1 Thirteenth International Meeting on DNA Computers June 5, 2007 Staged Self-Assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues Eric DemaineMassachusetts.
Active Tile Self Assembly: Daria Karpenko Department of Mathematics and Statistics, University of South Florida Simulating Cellular Automata at Temperature.
Alternative Tile Assembly Models and Complexity Results Tianqi Song.
An information-bearing seed for nucleating algorithmic self-assembly Presented by : Venkata Chaitanya Goli Robert D. Barish1, Rebecca Schulman1,
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.
Paul Rothemund, Departments of Computer Science and Computation & Neural Systems, California Institute of Technology Jerzy Szablowski : Biological.
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.
Self-Assembly Ho-Lin Chen Nov Self-Assembly is the process by which simple objects autonomously assemble into complexes. Geometry, dynamics,
Reducing Tile Complexity for Self-Assembly Through Temperature Programming Midwest Theory Day, December 10, 2006 Based on paper to appear in SODA 2006.
Complexities for Generalized Models of Self-Assembly Gagan Aggarwal Stanford University Michael H. Goldwasser St. Louis University Ming-Yang Kao Northwestern.
DNA Computing by Self Assembly  Erik Winfree, Caltech.
Robust Self-Assembly of DNA Eduardo Abeliuk Dept. of Electrical Engineering Stanford University November 30, 2006.
Complexities for Generalized Models of Self-Assembly Gagan Aggarwal Stanford University Michael H. Goldwasser St. Louis University Ming-Yang Kao Northwestern.
Reducing Tile Complexity for Self-Assembly Through Temperature Programming Symposium on Discrete Algorithms SODA 2006 January 23, 2006 Robert Schweller.
Ashish Goel Stanford University Joint work with Len Adleman, Holin Chen, Qi Cheng, Ming-Deh Huang, Pablo Moisset, Paul.
Threshold for Life MIT Media Laboratory Prof. Isaac Chuang.
Matthew J. Patitz Explorations of Theory and Programming in Self-Assembly Matthew J. Patitz Department of Computer Science University of Texas-Pan American.
1 Proceedings of the 24 th Annual ACM-SIAM Symposium on Discrete Algorithms January, 2013 Fuel Efficient Computation in Passive Self-Assembly Robert SchwellerUniversity.
DNA Based Self-Assembly and Nano-Device: Theory and Practice Peng Yin Committee Prof. Reif (Advisor), Prof. Agarwal, Prof. Hartemink Prof. LaBean, Prof.
1 Compact Error-Resilient Computational DNA Tiling Assemblies John H.Reif, Sudheer Sahu, and Peng Yin Presenter: Seok, Ho-SIK.
Molecular Self-Assembly: Models and Algorithms Ashish Goel Stanford University MS&E 319/CS 369X; Research topics in optimization; Stanford University,
Theoretical Tile Assembly Models Tianqi Song. Outline Wang tiling Abstract tile assembly model Reversible tile assembly model Kinetic tile assembly model.
Notes for self-assembly of thin rectangles Days 19, 20 and 21 of Comp Sci 480.
Notes on assembly verification in the aTAM Days 22, 24 and 25 of Comp Sci 480.
Notes on the two-handed assembly model (2HAM) Days 38 and 39 of Comp Sci 480.
Notes on the optimal encoding scheme for self-assembly Days 10, 11 and 12 Of Comp Sci 480.
1 Robert Schweller Electrical Engineering and Computer Science Department Northwestern University
4/4/20131 EECS 395/495 Algorithmic DNA Self-Assembly General Introduction Thursday, 4/4/2013 Ming-Yang Kao General Introduction.
Chapter 9.3 Grade 10 Biology Spring 2011 The Replication of DNA.
Notes on local determinism Days 12, 13 and 14 of Comp Sci 480.
Notes on temperature programming: lines and scaled shapes Days 28, 29 and 30 of Comp Sci 480.
An Introduction to Algorithmic Tile Self-Assembly.
TileSoft: Sequence Optimization Software for Designing DNA Secondary Structures P. Yin*, B. Guo*, C. Belmore*, W. Palmeri*, E. Winfree †, T. H. LaBean*
Notes on randomized self- assembly Days 34, 35, 36 and 37 of Comp Sci 480.
Notes for temperature 1 self- assembly Days 15, 16, 17 and 18 of Comp Sci 480.
Using Lateral Capillary Forces to Compute by Self-assembly Paul W. K. Rothemund PNAS, Feb. 1, 2000, vol. 97, no. 3, pp Summarized by Lee, In-Hee.
Flipping Tiles: Concentration Independent Coin Flips in Tile Self- Assembly Cameron T. Chalk, Bin Fu, Alejandro Huerta, Mario A. Maldonado, Eric Martinez,
Ashish Goel, 1 The Source of Errors: Thermodynamics Rate of correct growth ¼ exp(-G A ) Probability of incorrect growth ¼ exp(-G A.
Towards Autonomous Molecular Computers Towards Autonomous Molecular Computers Masami Hagiya, Proceedings of GP, Nakjung Choi
1 35 th International Colloquium on Automata, Languages and Programming July 8, 2008 Randomized Self-Assembly for Approximate Shapes Robert Schweller University.
1 January 18, 2010 Shape Replication through Self-Assembly and Rnase Enzymes Zachary AbelHarvard University Nadia BenbernouMassachusetts Institute of Technology.
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.
Developing DNA nanotechnology for use in nanoelectronics
Molecular Self-Assembly: Models and Algorithms Ashish Goel Stanford University MS&E 319/CS 369X; Research topics in optimization; Stanford University,
Molecular Algorithms -- Overview
Computational and Experimental Design of DNA Devices
Introduction to Tiling Assembly
Molecular Computation
Thirteenth International Meeting on DNA Computers
Self-Assembly of Shapes at Constant Scale Using Repulsive Forces
Tiing Error Correction & ExperimentsChen
A Sticker-Based Model for DNA Computation
DNA Self-Assembly Robert Schweller Northwestern University
Compact Error Resilient Computational DNA Tiling Assemblies
Information Redundancy Fault Tolerant Computing
Strict Self-Assembly of Discrete Sierpinski Triangles
Self-Assembly Ho-Lin Chen Nov
John H. Reif and Sudheer Sahu
Self-Assembly of Any Shape with
Combinatorial Optimization Problems in Self-Assembly (Given a shape, output an “efficient” tile-system for assembling it)
Complexities for the Design of Self-Assembly Systems
The Power of Nondeterminism in Self-Assembly
Notes on temperature programming
Algorithmic self-assembly with DNA tiles
Algorithms for Robust Self-Assembly
Presentation transcript:

1 David DotyCalifornia Institute of Technology Matthew J. PatitzUniversity of Texas Pan-American Dustin ReishusUniversity of Southern California Robert SchwellerUniversity of Texas Pan-American Scott M. SummersUniversity of Wisconsin-Platteville FOCS 2010 October 25, 2010 Strong Fault-Tolerance for Self-Assembly with Fuzzy Temperature

2 Outline Basic Tile Assembly Model Fuzzy Fault Tolerance Efficient, Fault Tolerant Results

3 Tile Assembly Model (Rothemund, Winfree, Adleman) T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 Tile Set: Glue Function: Temperature: x ed cba

4 T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 d e x ed cba Tile Assembly Model (Rothemund, Winfree, Adleman)

5 T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 d e x ed cba Tile Assembly Model (Rothemund, Winfree, Adleman)

6 T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 d e x ed cba bc Tile Assembly Model (Rothemund, Winfree, Adleman)

7 T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 d e x ed cba bc Tile Assembly Model (Rothemund, Winfree, Adleman)

8 T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 d e x ed cba bc Tile Assembly Model (Rothemund, Winfree, Adleman)

9 T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 d e x ed cba bca Tile Assembly Model (Rothemund, Winfree, Adleman)

10 T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 d e x ed cba bca Tile Assembly Model (Rothemund, Winfree, Adleman)

11 T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 d e x ed cba bca Tile Assembly Model (Rothemund, Winfree, Adleman)

12 T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 d e x ed cba bca Tile Assembly Model (Rothemund, Winfree, Adleman)

13 T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 x ed cba abc d e Tile Assembly Model (Rothemund, Winfree, Adleman)

14 T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 x ed cba x abc d e Tile Assembly Model (Rothemund, Winfree, Adleman)

15 T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 abc d e x x ed cba Tile Assembly Model (Rothemund, Winfree, Adleman)

16 T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 x ed cba abc d e xx Tile Assembly Model (Rothemund, Winfree, Adleman)

17 T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 x ed cba abc d e xx x Tile Assembly Model (Rothemund, Winfree, Adleman)

18 T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 x ed cba abc d e xx xx Tile Assembly Model (Rothemund, Winfree, Adleman)

19 Outline Basic Tile Assembly Model Errors! Fuzzy Fault Tolerance Efficient, Fault Tolerant Results

ideal cooperative binding: tile attaches to assembly if and only if it interacts with strength ≥ 2 (such as two matching strength-1 glues)

stable at temperature 1 = temporarily stable at temperature 2 stable at temperature 2 but not producible at temperature 2 a bd a x c a x c a bd a bd a x c c d c d more realistic kinetic model: tile attaches to assembly but detaches "quickly" if attached with only strength 1 (and detaches "slowly" if attached with strength 2) insufficient attachment... becomes stabilized by subsequent attachment: permanent error!

22 Outline Basic Tile Assembly Model Errors! Fuzzy Fault Tolerance Efficient, Fault Tolerant Results

 Dependably producible (DP): the set of supertiles that can be assembled at temperature = 2 abc d e xx abc d e xx xx d e x b

 Dependably producible (DP): the set of supertiles that can be assembled at temperature = 2  Dependably terminal (DT): the subset of DP supertiles that are terminal at temperature = 2 abc d e xx abc d e xx xx d e x b abc d e xx xx

 Dependably producible (DP): the set of supertiles that can be assembled at temperature = 2  Dependably terminal (DT): the subset of DP supertiles that are terminal at temperature = 2  Plausibly producible (PP): the set of supertiles that can be assembled at temperature = 1 abc d e xx abc d e xx xx d e x b abc d e xx xx abc d e xx xx xxxx abc d e xx xx xxxxxxxx

 Dependably producible (DP): the set of supertiles that can be assembled at temperature = 2  Dependably terminal (DT): the subset of DP supertiles that are terminal at temperature = 2  Plausibly producible (PP): the set of supertiles that can be assembled at temperature = 1  Plausibly stable (PS): the set of supertiles in PP that are stable at temperature = 2 abc d e xx abc d e xx xx d e x b abc d e xx xx abc d e xx xx xxxx abc d e xx xx xxxxxxxx abc d e xx xx xxxxxxxx

The Fuzzy Temperature Fault-Tolerance Design Problem Given a target shape X, design a tile set such that: Every PS supertile can grow into a DT supertile Every DT supertile has the shape X Tile set Desired shape Avoid this:

28 Goal: Design an efficient tile system for the assembly of a n x n square that is fuzzy fault tolerant. Result: O(log n) tile complexity construction for n x n squares that is fuzzy fault tolerant.

29 T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2 x ed cba abc d e xx xx Square Building

30 Square Building: Normal Approach n

31 Square Building x Tile Complexity: 2n n

Square Building 0000 log n -Use log n tile types to seed counter:

Square Building 0000 log n -Use 8 additional tile types capable of binary counting: -Use log n tile types capable of Binary counting:

Square Building 0000 log n Use 8 additional tile types capable of binary counting: -Use log n tile types capable of Binary counting:

Square Building Use 8 additional tile types capable of binary counting: -Use log n tile types capable of Binary counting: log n

Square Building Use 8 additional tile types capable of binary counting: -Use log n tile types capable of Binary counting:

Square Building n – log n log n x y Tile Complexity: O(log n) (Rothemund, Winfree 2000)

A Fuzzy Fault Tolerant Counter? A counter seems important for efficient assembly of n x n squares Current counter constructions are not fuzzy fault tolerant c c 0 1 nc 1 n 0 01 nn n n 0 1

[Barish, Shulman, Rothemund, Winfree, 2009]

40 Outline Basic Tile Assembly Model Errors! Fuzzy Fault Tolerance Efficient, Fault Tolerant Results

Strength-2 growth is error-free Idea: use nondeterministic strength-2 growth to guess numbers in counter and use geometric blocking (“steric hindrance”) to ensure they only come together in proper places. Strength-1 bonds used to enforce bumps are present when binding occurs Strength-2 bondsStrength-1 bonds

Previous Tile Set Not Fault Tolerant Producible at temperature 1 but stable (and erroneous) at temperature 2

Add more synchronization Each counter column is composed of 2 sub-columns, each which contributes a single strength bond at the top. Each must be fully complete for them to bind. Strength-1 glue Strength-2 glue

Fuzzy Temperature Fault-Tolerant Counter

Square Composed of One Horizontal Counter and Multiple Copies of Vertical Counter

Open Problems Make construction robust to non-rigidity of DNA tiles to enhance effectiveness of “programmed steric hindrance” Experimentally determine the largest size of supertiles that reliably attach Universal Computation and Fuzzy-Fault Tolerance? Assembly Time