1 January 18, 2010 Shape Replication through Self-Assembly and Rnase Enzymes Zachary AbelHarvard University Nadia BenbernouMassachusetts Institute of Technology.

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

1 Thirteenth International Meeting on DNA Computers June 5, 2007 Staged Self-Assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues Eric DemaineMassachusetts.
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.
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.
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.
1 Proceedings of the 24 th Annual ACM-SIAM Symposium on Discrete Algorithms January, 2013 Fuel Efficient Computation in Passive Self-Assembly Robert SchwellerUniversity.
One-Dimensional Staged Self-Assembly Erik Demaine, Sarah Eisenstat, Mashhood Ishaque, Andrew Winslow Funding in part by NSF grant CBET
Molecular Self-Assembly: Models and Algorithms Ashish Goel Stanford University MS&E 319/CS 369X; Research topics in optimization; Stanford University,
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.
An Introduction to Algorithmic Tile Self-Assembly.
Notes for temperature 1 self- assembly Days 15, 16, 17 and 18 of Comp Sci 480.
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.
1 David DotyCalifornia Institute of Technology Matthew J. PatitzUniversity of Texas Pan-American Dustin ReishusUniversity of Southern California Robert.
Towards Autonomous Molecular Computers Towards Autonomous Molecular Computers Masami Hagiya, Proceedings of GP, Nakjung Choi
5.1 The Cell Cycle TEKS 5A The student is expected to: 5A describe the stages of the cell cycle, including deoxyribonucleic acid (DNA) replication and.
1 35 th International Colloquium on Automata, Languages and Programming July 8, 2008 Randomized Self-Assembly for Approximate Shapes Robert Schweller University.
Objectives: Calculate the Volume of Prisms Calculate the Volume of Cylinders.
Molecular Self-Assembly: Models and Algorithms Ashish Goel Stanford University MS&E 319/CS 369X; Research topics in optimization; Stanford University,
The cell cycle is a regular pattern of growth, DNA replication, and cell division.
Molecular Self-Assembly: Models and Algorithms Ashish Goel Stanford University MS&E 319/CS 369X; Research topics in optimization; Stanford University,
The student is expected to: 5A describe the stages of the cell cycle, including deoxyribonucleic acid (DNA) replication and mitosis, and the importance.
Introduction to Tiling Assembly
Thirteenth International Meeting on DNA Computers
Self-Assembly of Shapes at Constant Scale Using Repulsive Forces
DNA Self-Assembly Robert Schweller Northwestern University
KEY CONCEPT (video at end of powerpoint) Cells have distinct phases of growth, reproduction, and normal functions.
The cell cycle has four main stages.
The cell cycle has four main stages.
The cell cycle has four main stages.
The cell cycle has four main stages.
The cell cycle has four main stages.
The cell cycle has four main stages.
The cell cycle has four main stages.
The cell cycle has four main stages.
The cell cycle has four main stages.
Strict Self-Assembly of Discrete Sierpinski Triangles
The cell cycle has four main stages.
The cell cycle has four main stages.
The cell cycle has four main stages.
The cell cycle has four main stages.
KEY CONCEPT Cells have distinct phases of growth, reproduction, and normal functions. BIG PICTURE…THIS IS HOW YOUR CELL DIVIDES AND SPLITS IN 2.
Self-Assembly Ho-Lin Chen Nov
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 cell cycle has four main stages.
The Power of Nondeterminism in Self-Assembly
Notes on temperature programming
The cell cycle has four main stages.
The cell cycle has four main stages.
The cell cycle has four main stages.
The cell cycle has four main stages.
The cell cycle has four main stages.
Algorithms for Robust Self-Assembly
The cell cycle has four main stages.
The cell cycle has four main stages.
The student is expected to: 5A describe the stages of the cell cycle, including deoxyribonucleic acid (DNA) replication and mitosis, and the importance.
The cell cycle has four main stages.
Presentation transcript:

1 January 18, 2010 Shape Replication through Self-Assembly and Rnase Enzymes Zachary AbelHarvard University Nadia BenbernouMassachusetts Institute of Technology Mirela DamianVillanova University Erik D. DemaineMassachusetts Institute of Technology Martin DemaineMassachusetts Institute of Technology Robin FlatlandSiena College Skott D. KominersHarvard University Robert SchwellerUniversity of Texas Pan American Read: Replicate:

2 Outline Basic Model RNA enzyme model Shape replication Precise yield shape replication Infinite yield shape replication

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 (Basic)Tile Assembly Model (Rothemund, Winfree, Adleman)

19 Outline Basic Model RNA enzyme model Shape replication Precise yield shape replication Infinite yield shape replication

20 RNA enzyme Self-Assembly (suggested by Rothemund, Winfree 2000) RNA tile types DNA tile types RNA assembly model: Assembly occurs over a number of stages. At each stage you may: 1) Add a new collection of tile types - Allow for further growth - All added types have infinite count 2) Add an Rnase enzyme - Dissolve all RNA tile types - May break apart assemblies All tile types are of either DNA or RNA makeup:

21 RNA enzyme Self-Assembly Stage 1:

22 RNA enzyme Self-Assembly Stage 1:

23 RNA enzyme Self-Assembly Stage 1: Stage 2:

24 RNA enzyme Self-Assembly Stage 1: Stage 2:

25 RNA enzyme Self-Assembly Stage 1: Stage 2: Stage 3: Enzyme

26 RNA enzyme Self-Assembly Stage 1: Stage 2: Stage 3: Enzyme

27 RNA enzyme Self-Assembly Stage 1: Stage 2: Stage 3: Enzyme

28 RNA enzyme Self-Assembly Stage 1: Stage 2: Stage 3: Enzyme Stage 4:

29 RNA enzyme Self-Assembly Stage 1: Stage 2: Stage 3: Enzyme Stage 4:

30 RNA enzyme Self-Assembly Stage 1: Stage 2: Stage 3: Enzyme Stage 4:

31 RNA enzyme Self-Assembly Stage 1: Stage 2: Stage 3: Enzyme Stage 4:

32 RNA enzyme Self-Assembly Metrics for efficiency: Tile complexity: total number of distinct tile types used in the system. Stage complexity: total number of distinct stages used.

33 Outline Basic Model RNA enzyme model Shape replication Precise yield shape replication Infinite yield shape replication

Shape Replication Problem Design an assembly system (algorithm) that will replicate a large number of copies given a single copy of a pre-assembled input shape. Precise Yield: Replicate exactly n copies for a given n Infinite Yield: Replicate infinite copies -in practice, the number of copies should only be limited by the volume of particles available.

35 Outline Basic Model RNA enzyme model Shape replication Precise yield shape replication Infinite yield shape replication

Precise Yield: rectangles

aaaa a a a a a a aaaa a a a a a a

nnnn e e e e e e w w w w w w ssss

nnnn e e e e e e w w w w w w ssss n w xx y y

nnnn e e e e e e w w w w w w ssss n w

nnnn e e e e e e w w w w w w ssss n w n e s ws e

nnnn e e e e e e w w w w w w ssss n w n e s w s e

n nn n e e e e e e w w w w w w ssss a w a a a

nn e e w w ss Step 1: Coat shape with layer of RNA

Precise Yield: rectangles nn e e w w ss Step 2: Coat shape with layer of DNA Step 1: Coat shape with layer of RNA

Precise Yield: rectangles Step 2: Coat shape with layer of DNA. Step 3: Add enzyme. Step 1: Coat shape with layer of RNA.

Precise Yield: rectangles Step 2: Coat shape with layer of DNA. Step 3: Add enzyme. Step 1: Coat shape with layer of RNA.

Precise Yield: rectangles Step 2: Coat shape with layer of DNA. Step 3: Add enzyme. Step 4: Coat frame with layer of RNA. Step 1: Coat shape with layer of RNA.

Precise Yield: rectangles Step 2: Coat shape with layer of DNA. Step 3: Add enzyme. Step 4: Coat frame with layer of RNA. Step 1: Coat shape with layer of RNA.

Precise Yield: rectangles Step 2: Coat shape with layer of DNA. Step 3: Add enzyme. Step 4: Coat frame with layer of RNA. Step 5: Fill frame with DNA. Step 1: Coat shape with layer of RNA.

Precise Yield: rectangles Step 2: Coat shape with layer of DNA. Step 3: Add enzyme. Step 4: Coat frame with layer of RNA. Step 5: Fill frame with DNA. Step 1: Coat shape with layer of RNA.

Precise Yield: rectangles Step 2: Coat shape with layer of DNA. Step 3: Add enzyme. Step 4: Coat frame with layer of RNA. Step 5: Fill frame with DNA. Step 6: Add enzyme. Step 1: Coat shape with layer of RNA.

Precise Yield: rectangles Step 2: Coat shape with layer of DNA. Step 3: Add enzyme. Step 4: Coat frame with layer of RNA. Step 5: Fill frame with DNA. Step 6: Add enzyme. Step 1: Coat shape with layer of RNA.

Precise Yield: General Shapes

Precise Yield: rectangles

Tile typesO(1) StagesO(log n) Precise Yield: n copies Precise Yield: rectangles Tile typesO(log n) StagesO(1) Precise Yield: n copies

59 Outline Basic Model RNA enzyme model Shape replication Precise yield shape replication Infinite yield shape replication

Infinite Yield: Rectangles nnnn e e e e e e w w w w w w ssss

nnnn e e e e e e w w w w w w ssss s w a

a s b s b s a b ss a s Stair step tiles: x x

Infinite Yield: Rectangles a s b s b s a b ss Stair step tiles: x x b x

Infinite Yield: Rectangles a s b s b s a b ss Stair step tiles: x x a b

Infinite Yield: Rectangles a s b s b s a b s s Stair step tiles: x x a b

Infinite Yield: Rectangles a s b s b s a b s Stair step tiles: x x b a b

Infinite Yield: Rectangles a s b s b s a b s Stair step tiles: x x b a b

Infinite Yield: Rectangles a s b s b s a b s Stair step tiles: x x b a b

Infinite Yield: Rectangles a s b s b s a b Stair step tiles: x x b b b a

Infinite Yield: Rectangles a s b s b s a b Stair step tiles: x x

Infinite Yield: Rectangles a s b s b s a b Stair step tiles: x x

Infinite Yield: Rectangles a s b s b s a b Stair step tiles: x x …

Infinite Yield: Rectangles Tile typesO(1) StagesO(1) Infinite Yield: Rectangles

Infinite Yield: General Shapes

Step 1: Coat with RNA

Infinite Yield: General Shapes Step 2: Create rectangular DNA encasing

Infinite Yield: Binary counter tool cccccccccccccccccccccccc

1 ccccccccccccccccccccccc m nn nn cc nc 1 m m x x Binary counter tiles: c 0 1 mm n

1 Infinite Yield: Binary counter tool 1 cccccccccccccccccccccc 0 0 m nn nn cc nc 1 m m x x Binary counter tiles: c 0 1 mm n

1 Infinite Yield: Binary counter tool 1 ccccccccccccccccccccc 0 m 1 1 n nn nn cc nc 1 m m x x Binary counter tiles: c 0 1 mm n

1 Infinite Yield: Binary counter tool 1 ccccccccccccccccccccc nn nn cc nc 1 m m x x Binary counter tiles: c 0 0 m mm n 1

1 Infinite Yield: Binary counter tool 1 cccccccccccccccccccc nn nn cc nc 1 m m x x Binary counter tiles: c mm n c m

1 Infinite Yield: Binary counter tool 1 cccccccccccccccccccc nn nn cc nc 1 m m x x Binary counter tiles: c 0 0 m 1 1 mm n

1 Infinite Yield: Binary counter tool 1 ccccccccccccccccccc nn nn cc nc 1 m m x x Binary counter tiles: c 0 0 m 1 1 mm n n

1 Infinite Yield: Binary counter tool 1 ccccccccccccccccccc nn nn cc nc 1 m m x x Binary counter tiles: c 0 0 m 1 1 mm n n 0 0

1 Infinite Yield: Binary counter tool 1 ccccccccccccccccccc nn nn cc nc 1 m m x x Binary counter tiles: c 0 0 m 1 1 mm n

1 Infinite Yield: Binary counter tool nn nn cc nc 1 m m x x Binary counter tiles: c mm n

Infinite Yield: General Shapes … …

… …

Step 3: Label each face with unique binary code

Infinite Yield: General Shapes Step 4: Enzyme.

Infinite Yield: General Shapes … Step 5: Infinitely replicate all labeled rectangles

Infinite Yield: General Shapes

Reassembly?

Infinite Yield: General Shapes Reassembly?

Infinite Yield: General Shapes Reassembly?

Infinite Yield: General Shapes Reassembly?

Infinite Yield: General Shapes Step 6: Reassemble, fill in frame, break out copies with enzyme.

Infinite Yield: General Shapes Tile typesO(1) StagesO(1) Infinite Yield: Vertically convex

Infinite Yield: Non-vertically convex shapes Grow counter along surface of shape

Grow counter along surface of shape Start end Infinite Yield: Non-vertically convex shapes

Grow counter along surface of shape Break apart with enzyme Infinite Yield: Non-vertically convex shapes

Grow counter along surface of shape Break apart with enzyme Replicate Infinite Yield: Non-vertically convex shapes

Grow counter along surface of shape Break apart with enzyme Replicate Reassemble Infinite Yield: Non-vertically convex shapes

Grow counter along surface of shape Break apart with enzyme Replicate Reassemble Infinite Yield: Non-vertically convex shapes

107 Tile typesO(1) StagesO(1) Infinite Yield: Infinite Yield: General Shapes

Future Work Replicate and improve -Hybrid algorithms for replication and modification Extension to 3D -Planarity/spacial constraint Replication of internal pattern Staged enzyme model for assembly from scratch - Seems to be very powerful for this Temperature changes to perform replication

109 January 18, 2010 Thank you. Questions? Zachary AbelHarvard University Nadia BenbernouMassachusetts Institute of Technology Mirela DamianVillanova University Erik D. DemaineMassachusetts Institute of Technology Martin DemaineMassachusetts Institute of Technology Robin FlatlandSiena College Skott D. KominersHarvard University Robert SchwellerUniversity of Texas Pan American Read: Replicate: