Theoretical Tile Assembly Models Tianqi Song. Outline Wang tiling Abstract tile assembly model Reversible tile assembly model Kinetic tile assembly model.

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.
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,
Polymerization reactions chapter 4. Fall outline Introduction Classifications Chain Polymerization (free radical initiation) Reaction Mechanism.
Gibbs sampler - simple properties It’s not hard to show that this MC chain is aperiodic. Often is reversible distribution. If in addition the chain is.
Ch. 10: What is a number?. MAIN DEFINITION OF THE COURSE: A symmetry of an object (in the plane or space) means a rigid motion (of the plane or space)
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.
Entropy Rates of a Stochastic Process
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.
Chapter 11: Limitations of Algorithmic Power
Ashish Goel Stanford University Joint work with Len Adleman, Holin Chen, Qi Cheng, Ming-Deh Huang, Pablo Moisset, Paul.
4.2 Graphing linear equations Objective: Graph a linear equation using a table of values.
1.1 Relations and Functions
Information Networks Power Laws and Network Models Lecture 3.
Matthew J. Patitz Explorations of Theory and Programming in Self-Assembly Matthew J. Patitz Department of Computer Science University of Texas-Pan American.
4.2 Linear Relations Math 9.
Theory of Computing Lecture 15 MAS 714 Hartmut Klauck.
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,
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.
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.
1 Design of LDPC codes Codes from finite geometries Random codes: Determine the connections of the bipartite Tanner graph by using a (pseudo)random algorithm.
An Introduction to Algorithmic Tile Self-Assembly.
DNA computing on a chip Mitsunori Ogihara and Animesh Ray Nature, 2000 발표자 : 임예니.
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.
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.
CSE280Stefano/Hossein Project: Primer design for cancer genomics.
The Multistrand Simulator: Stochastic Simulation of the Kinetics of Multiple Interacting DNA Strands Joseph Schaeffer, Caltech (slides by John Reif)
1 Organic Chemistry, Third Edition Janice Gorzynski Smith University of Hawai’i Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction.
Introduction to PCR Polymerase Chain Reaction
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,
Warm-up (10 min.) I. Factor the following expressions completely over the real numbers. 3x3 – 15x2 + 18x x4 + x2 – 20 II. Solve algebraically and graphically.
Molecular Self-Assembly: Models and Algorithms Ashish Goel Stanford University MS&E 319/CS 369X; Research topics in optimization; Stanford University,
Rates October 2016.
Introduction to Tiling Assembly
Trigonometric Identities
Thirteenth International Meeting on DNA Computers
Self-Assembly of Shapes at Constant Scale Using Repulsive Forces
Enumerating Distances Using Spanners of Bounded Degree
Tiing Error Correction & ExperimentsChen
DNA Self-Assembly Robert Schweller Northwestern University
Chapter 17 The Reaction Process.
Warm-up (10 min.) I. Factor the following expressions completely over the real numbers. 3x3 – 15x2 + 18x x4 + x2 – 20 II. Solve algebraically and graphically.
Strict Self-Assembly of Discrete Sierpinski Triangles
Self-Assembly Ho-Lin Chen Nov
John H. Reif and Sudheer Sahu
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
Volume 23, Issue 10, Pages (October 2016)
The Power of Nondeterminism in Self-Assembly
Complexity Theory in Practice
Notes on temperature programming
Algorithms for Robust Self-Assembly
Brownian Dynamics of Subunit Addition-Loss Kinetics and Thermodynamics in Linear Polymer Self-Assembly  Brian T. Castle, David J. Odde  Biophysical Journal 
Presentation transcript:

Theoretical Tile Assembly Models Tianqi Song

Outline Wang tiling Abstract tile assembly model Reversible tile assembly model Kinetic tile assembly model Multiple temperature model q-tile assembly model Flexible glue model Time-dependent glue model Step-wise assembly model Staged assembly model

Wang Tiling Proposed by Hao Wang in Given a finite set of square tiles with a glue on each side. Question: whether they can tile the plane with same abutting glue. Note that tiles cannot be rotated or reflected and you can use infinite number of copies of each tile.

Example of Wang Tiling This tile set contain 13 tiles. They can tile the plane aperiodically as shown in next page. Designed by Karel Culik II in Picture is from Wikipedia.

Example of Wang Tiling This picture is from Wikipedia.

Abstract Tile Assembly Model Proposed by Erik Winfree and Paul W.K. Rothemund in A tiling system under aTAM is a quadruple. T is a set of tiles. A tile is a square with a glue on each side. E E W W S S N N

Abstract Tile Assembly Model s is seed tile. The initial configuration has only seed tile. τ is temperature: the minimum accumulative strength that can fix a tile in a configuration. g is glue strength function: G×G->N +, where G is glue set. For any x, y in G, g(x, y)=g(y, x). A configuration is a function: Z×Z->T U {empty}, where Z is integer set.

Tile Complexity Tile complexity or program-size complexity: the minimum number of tile types required to assemble a shape.[Erik Winfree and Paul W.K. Rothemund STOC 2000] A special case: in the linear version proposed by Chandran et al, the tile set is MULTISET.

Time Complexity Time complexity or running time: model the assembly process by continuous Markov process.[Adleman et al STOC 2001] Example of continuous Markov process. Picture is from Wikipedia

Time Complexity States: possible configurations. Rate between state S1 and S2: if S2 is got by attaching a tile x to S1. The rate is the concentration of tile x. Otherwise, no edge between S1 and S2. The time from initial configuration to the terminal configuration is a random variable. Time complexity is the expected value of the random variable

Reversible Tile Assembly Model Proposed by Leonard M. Adleman in 1999 to study linear assembly. Define two functions: (1) σ: G×G->[0,1] (2) v: G×G->[0,1] where G is the glue set. σ(g1,g2) is the probability of sticking between glue g1 and g2. v(g1,g2) is the probability of unsticking between glue g1 and g2.

Kinetic Tile Assembly Model Proposed by Erik Winfree in Four assumptions: (1) All monomers hold the same constant concentration. (2)There are not interactions among aggregates.

Kinetic Tile Assembly Model Four assumptions(continue): (3) All monomers have the same forward rate constant. (4) The reverse rate depends exponentially on the number of pairs need to be broken.

Kinetic Tile Assembly Model Picture is from paper written by Erik Winfree in 1998

Kinetic Tile Assembly Model r f =k f [monomer]=k f e -G mc r r,b =k r,b =k f e -bG se k f is the forward rate constant. [monomer] is the concentration of some kind of monomer. G mc is a measure of entropic cost of fixing a monomer at a particular position. It is decided by the concentration of monomer.

Kinetic Tile Assembly Model G se is a measure of free energy cost to break a double helix of length s, where G se = (4000K/T- 11)s. b is the number of s-length double helix that need to be broken.

Multiple Temperature Model Proposed by Aggarwal et al. in Replace temperature t in the standard model by a sequence of temperatures {τ i } i=1. A system that has k temperatures is a k- temperature system. Assembly mechanism: the assembly process of a k-temperature system has k phases as shown in the Figure(next page). k

Multiple Temperature Model Assemble and disassemble under temperature τ 1 for long enough time. Assemble and disassemble under temperature τ k for long enough time. Phase 1 Phase k The terminal product of phase k is the terminal product of this k-temperature system.

Flexible Glue Model Proposed by by Aggarwal et al. in In standard model: g(x, y)= 0 if x≠y. In flexible glue model: g(x, y) may not be 0 when x≠y.

q-Tile Model Proposed by by Aggarwal et al. in In standard model: only single tile can attach to the growing supertile containing seed. In q-tile model: supertiles of size not larger than q can form and attach to the seed supertile if the accumulative glue strength between two supertiles is not less than temperature. Standard model is exactly 1-tile model.

Time-dependent Glue Model Proposed by Sahu et al. in The glue strength function g is defined differently from standard model: g: G×G×R -> R. g(x, y, t) is the glue strength between glue x and glue y when they have been juxtaposed for t time.

Time-dependent Glue Model Picture is from the paper by Sahu et al. in 2005

Time-dependent Glue Model As shown in the figure, define r: G×G-> R as time for maximum glue strength. g(x, y, t) is growing when t< r(x, y). When t≥ r(x, y), g(x, y, t)= g(x, y, r(x, y)). Define u: G×G-> R as minimum interaction time between two glues.

Time-dependent Glue Model An example from Sahu’s paper:

Step-wise Assembly Model Proposed by Reif in A tiling system under step-wise assembly model is a quadruple S step =, where k is the number of steps, T i is the tile set at step i, is τ i is the temperature at step i. The assembly process is shown in the Figure(next page). k k

Step-wise Assembly Model Put in T 1 including s. Assemble under temperature τ 1 for long enough time. Put in T k in. Assemble under temperature τ k for long enough time. step 1 (in tube 1) step k (in tube k) terminal product of step 1 terminal product of step k-1 The terminal product of step k is the terminal product of this k-step system.

Staged Assembly Model Proposed by Demaine et al. in It is a generalized version of step-wise assembly model. The assembly process under staged assembly model is shown in the Figure(next page).

Staged Assembly Model This picture is from paper by Demaine et al. Vertices of mix graph represent bins for separated assembly reactions. Each bin has its only tile set and temperature. Only terminal product of one bin is delivered to bins in next stage.