Reducing Tile Complexity for Self-Assembly Through Temperature Programming Midwest Theory Day, December 10, 2006 Based on paper to appear in SODA 2006.

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 Squares, Rectangles and Sticks Tandi Clausen-May Click the mouse to continue.
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.
Intrinsic Universality in Tile Self-Assembly Requires Cooperation Pierre-Etienne Meunier Matthew J. Patitz Scott M. Summers Guillaume Theyssier Damien.
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.
Staged Self-Assembly and Polyomino Context-Free Grammars Andrew Winslow Defense Edition.
Self-Assembly Ho-Lin Chen Nov Self-Assembly is the process by which simple objects autonomously assemble into complexes. Geometry, dynamics,
Complexities for Generalized Models of Self-Assembly Gagan Aggarwal Stanford University Michael H. Goldwasser St. Louis University Ming-Yang Kao Northwestern.
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.
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.
The Tile Complexity of Linear Assemblies Dept of Computer Science, Duke University Harish Chandran, Nikhil Gopalkrishnan, John Reif { harish, nikhil, reif.
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.
Multiplication Facts 1-25
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 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.
Horn Clause Computation by Self-Assembly of DNA Molecules Hiroki Uejima Masami Hagiya Satoshi Kobayashi.
Area Models for Multiplication. Represent the situation with your tiles, a diagram, a repeated addition equation, and a multiplication equation. Trina’s.
An Introduction to Algorithmic Tile Self-Assembly.
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.
Flipping Tiles: Concentration Independent Coin Flips in Tile Self- Assembly Cameron T. Chalk, Bin Fu, Alejandro Huerta, Mario A. Maldonado, Eric Martinez,
What questions could we ask about this tile?. What if… We put 2 together?
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.
Notes on temperature programming: unique assembly verification Days 30 and 31 of Comp Sci 480.
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.
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,
Molecular Algorithms -- Overview
Molecular Self-Assembly: Models and Algorithms Ashish Goel Stanford University MS&E 319/CS 369X; Research topics in optimization; Stanford University,
Using Algebra Tiles.
Introduction to Tiling Assembly
Molecular Computation
Thirteenth International Meeting on DNA Computers
Self-Assembly of Shapes at Constant Scale Using Repulsive Forces
Analysis of Algorithms
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
Connecting Algebra Tiles to Integer Tiles
Strict Self-Assembly of Discrete Sierpinski Triangles
Shapes.
Self-Assembly Ho-Lin Chen Nov
Self-Assembly of Any Shape with
Logarithms.
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
Solving Equations Algebra tiles can be used to explain and justify the equation solving process. The development of the equation solving model is based.
Can you work out the next shape in the pattern?
Presentation transcript:

Reducing Tile Complexity for Self-Assembly Through Temperature Programming Midwest Theory Day, December 10, 2006 Based on paper to appear in SODA 2006 by Ming-Yang Kao Northwestern University Robert Schweller Northwestern University

Tile Model of Self-Assembly (Rothemund, Winfree STOC 2000) Tile System: t : temperature, positive integer G: glue function T: tileset s: seed tile

How a tile system self assembles T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2

How a tile system self assembles T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2

How a tile system self assembles T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2

How a tile system self assembles T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2

How a tile system self assembles T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2

How a tile system self assembles T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2

How a tile system self assembles T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2

How a tile system self assembles T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2

How a tile system self assembles T = G(y) = 2 G(g) = 2 G(r) = 2 G(b) = 2 G(p) = 1 G(w) = 1 t = 2

Each Shape Requires a Distinct Tile Set

Programmable, General Purpose Tile Set?

...

Multiple Temperature Model - temperature may go up and down (Aggarwal, Cheng, Goldwasser, Kao, Espanes, Schweller, SICOMP 2005)

Multiple Temperature Model - temperature may go up and down t (Aggarwal, Cheng, Goldwasser, Kao, Espanes, Schweller, SICOMP 2005)

Multiple Temperature Model - temperature may go up and down t (Aggarwal, Cheng, Goldwasser, Kao, Espanes, Schweller, SICOMP 2005) Tile Complexity:Number of Tiles Temperature Complexity:Number of Temperatures

Building k x N Rectangles k-digit, base N (1/k) counter: k N

Building k x N Rectangles k-digit, base N (1/k) counter: Tile Complexity: N k

two temperatures t = 4

t = 4 6 two temperatures

Programmable, General Purpose Tile Set?...

Given: n log n High Level Approach

Given: n log n temp High Level Approach 1

Given: n log n temp High Level Approach 1 1

Given: n log n temp High Level Approach 10 10

Given: n log n temp High Level Approach

temp High Level Approach

temp High Level Approach

temp High Level Approach

Assembly of N x N Squares N - k k

Assembly of N x N Squares N - k k

Assembly of N x N Squares N - k k

Assembly of N x N Squares N - k k Complexity:

Assembly of N x N Squares N – log N log N Complexity:

Assembly of N x N Squares N – log N log N Complexity: seed row

Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz 1 0 1

a Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz t =

a Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz t = 0

a Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz t = 0

a Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz t = 0 0’ z

a Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz t = 0 0’ Z

a Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz t = 0 0’ Z

a Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz t = 0 0’ Z

a Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz t = 0 0’ Z

a Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz t = 0 0’ Z

a Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz t = 0 0’ Z

a Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz t = 0 0’ Z x

a Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz t = 0 0’ Z 1

a Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz t = Z 1 1’ z

a Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz t = Z 1’

a Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz t = Z 1’ 1

a Encoding a Single Bit 0 a Z g z g g g g g g g g g 01 0’1’ zz t = Z 1’ 1 a Z t = 0 0’

Goal:

a 0 s b temp:

a 1 s b Goal: temp:

a 1 s Goal: b X temp:

a 1 s Goal: b Y temp:

a 1 s Goal: b Y temp: a b

a 1 s Goal: b Y temp: a b 0

a 1 s Goal: b Y temp: a b 0 X

a 1 s Goal: b Y temp: a b 0 Y a b

a 1 s Goal: b Y temp: a b 0 Y a b 0

a 1 s Goal: b Y temp: a b 0 Y a b 1

a 1 s Goal: b Y temp: a b 0 Y a b 1 X

a 1 s Goal: b Y temp: a b 0 Y a b 1 Y a b

a 1 s Goal: b Y temp: a b 0 Y a b 1 Y a b 0

a 1 s Goal: b Y temp: a b 0 Y a b 1 Y a b 0 X

a 1 s Goal: b Y temp: a b 0 Y a b 1 Y a b 0 Y a b

a 1 s Goal: b Y temp: a b 0 Y a b 1 Y a b 0 Y a b 0

a 1 s Goal: b Y temp: a b 0 Y a b 1 Y a b 0 Y a b 0 X

Assembly of N x N Squares N – log N log N

Assembly of N x N Squares O(log N)

Assembly of N x N Squares O(log n)

Single Tile set, can build ALL n x n squares –O(1) tile complexity –O(log n) temperature complexity For any n x n square –O(log n / loglog n) –O(1) temperature complexity Is there a smooth tradeoff? –NO: For almost all n, no tileset can achieve both o(log n/ loglog n) tile complexity and o(log n) temperature complexity simultaneously. Results ( Adleman, Cheng, Goel, Huang STOC 2001 )

Single Tile set, can build ALL n x n squares –O(1) tile complexity –O(log n) temperature complexity For any n x n square –O(log n / loglog n) –O(1) temperature complexity Is there a smooth tradeoff? –NO: For almost all n, no tileset can achieve both o(log n/ loglog n) tile complexity and o(log n) temperature complexity simultaneously. Results ( Adleman, Cheng, Goel, Huang STOC 2001 )

Single Tile set, can build ALL n x n squares –O(1) tile complexity –O(log n) temperature complexity For any n x n square –O(log n / loglog n) –O(1) temperature complexity Is there a smooth tradeoff? –NO: For almost all n, no tileset can achieve both o(log n/ loglog n) tile complexity and o(log n) temperature complexity simultaneously. Results ( Adleman, Cheng, Goel, Huang STOC 2001 )

Single Tile set, can build ALL n x n squares –O(1) tile complexity –O(log n) temperature complexity For any n x n square –O(log n / loglog n) –O(1) temperature complexity Is there a smooth tradeoff? –NO: For almost all n, no tileset can achieve both o(log n/ loglog n) tile complexity and o(log n) temperature complexity simultaneously. Results ( Adleman, Cheng, Goel, Huang STOC 2001 )

Thanks for Listening Questions? 4 th year Graduate Student Electrical Engineering and Computer Science Department Northwestern University Advisor: Ming-Yang Kao