Flipping Tiles: Concentration Independent Coin Flips in Tile Self- Assembly Cameron T. Chalk, Bin Fu, Alejandro Huerta, Mario A. Maldonado, Eric Martinez,

Slides:



Advertisements
Similar presentations
Simulation Examples in EXCEL Montana Going Green 2010.
Advertisements

Ashish Goel, 1 A simple analysis Suppose complementary DNA strands of length U always stick, and those of length L never stick (eg:
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.
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.
Lecture 22: April 18 Probabilistic Method. Why Randomness? Probabilistic method: Proving the existence of an object satisfying certain properties without.
The Power of Seeds in Tile Self-Assembly Andrew Winslow Department of Computer Science, Tufts University.
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.
ACT1 Slides by Vera Asodi & Tomer Naveh. Updated by : Avi Ben-Aroya & Alon Brook Adapted from Oded Goldreich’s course lecture notes by Sergey Benditkis,
Descriptive statistics Experiment  Data  Sample Statistics Experiment  Data  Sample Statistics Sample mean Sample mean Sample variance Sample variance.
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 On the Power of the Randomized Iterate Iftach Haitner, Danny Harnik, Omer Reingold.
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.
Packing Rectangles into Bins Nikhil Bansal (CMU) Joint with Maxim Sviridenko (IBM)
Secure Computation (Lecture 5) Arpita Patra. Recap >> Scope of MPC > models of computation > network models > modelling distrust (centralized/decentralized.
COMP 170 L2 L17: Random Variables and Expectation Page 1.
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.
ALGEBRAIC EXPRESSIONS JEOPARDY! TEST REVIEW!!!. Like Terms Simplify using Distribution Evaluate Factor the Expression
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.
Distribute and Combine Like Terms Applications. What is the area of the following shape? 5 2x-3 1.
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.
Math 4030 – 6a Joint Distributions (Discrete)
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.
1 David DotyCalifornia Institute of Technology Matthew J. PatitzUniversity of Texas Pan-American Dustin ReishusUniversity of Southern California Robert.
1 35 th International Colloquium on Automata, Languages and Programming July 8, 2008 Randomized Self-Assembly for Approximate Shapes Robert Schweller University.
Localized DNA Circuits Hieu Bui 1. Outline  Localized Kinetics & Modelling  Localized Hybridization Reactions  On Nanotracks  On DNA Origami 2.
1 January 18, 2010 Shape Replication through Self-Assembly and Rnase Enzymes Zachary AbelHarvard University Nadia BenbernouMassachusetts Institute of Technology.
Descriptive Statistics Experiment Simulations Confidence Intervals Sampling Distribution Simulations Main Menu.
Subtraction of Polynomials Maths 8. Can you remove these tiles? Is this a positive or negative 1? Subtraction without the Zero principle Example : (3x.
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.
Staged Self-Assembly and Polyomino Context-Free Grammars
Exponent Bingo.
Molecular Self-Assembly: Models and Algorithms Ashish Goel Stanford University MS&E 319/CS 369X; Research topics in optimization; Stanford University,
Molecular Self-Assembly: Models and Algorithms Ashish Goel Stanford University MS&E 319/CS 369X; Research topics in optimization; Stanford University,
Introduction to Tiling Assembly
Molecular Computation
Thirteenth International Meeting on DNA Computers
Some Rules for Expectation
Self-Assembly of Shapes at Constant Scale Using Repulsive Forces
Tiing Error Correction & ExperimentsChen
DNA Self-Assembly Robert Schweller Northwestern University
Compact Error Resilient Computational DNA Tiling Assemblies
Preliminaries: Distributions
Exponent Bingo.
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
Sudheer Sahu John H. Reif Duke University
The Power of Nondeterminism in Self-Assembly
Notes on temperature programming
Algorithms for Robust Self-Assembly
Presentation transcript:

Flipping Tiles: Concentration Independent Coin Flips in Tile Self- Assembly Cameron T. Chalk, Bin Fu, Alejandro Huerta, Mario A. Maldonado, Eric Martinez, Robert T. Schweller, Tim Wylie Funding by NSF Grant CCF NSF Early Career Award ? ?

Introduction Models Concentration Independent Coin Flip Big Seed, Temperature 1 Single Seed, Temperature 2 Simulation Simulation Application Unstable Concentrations Summary

? ?

Introduction Models Concentration Independent Coin Flip Big Seed, Temperature 1 Single Seed, Temperature 2 Simulation Simulation Application Unstable Concentrations Summary

Tile Assembly Model (Rothemund, Winfree, Adleman) Tileset: S Glue: G(g) = 2 G(o) = 2 G(y) = 2 G(r) = 2 G(b) = 1 G(p) = 1 S Temperature: 2 Seed:

Tile Assembly Model (Rothemund, Winfree, Adleman) Tileset: S Glue: G(g) = 2 G(o) = 2 G(y) = 2 G(r) = 2 G(b) = 1 G(p) = 1 S Temperature: 2 Seed: S

Tile Assembly Model (Rothemund, Winfree, Adleman) Tileset: S Glue: G(g) = 2 G(o) = 2 G(y) = 2 G(r) = 2 G(b) = 1 G(p) = 1 S Temperature: 2 Seed: S

Tile Assembly Model (Rothemund, Winfree, Adleman) Tileset: S Glue: G(g) = 2 G(o) = 2 G(y) = 2 G(r) = 2 G(b) = 1 G(p) = 1 S Temperature: 2 Seed: S

Tile Assembly Model (Rothemund, Winfree, Adleman) Tileset: S Glue: G(g) = 2 G(o) = 2 G(y) = 2 G(r) = 2 G(b) = 1 G(p) = 1 S Temperature: 2 Seed: S

Tile Assembly Model (Rothemund, Winfree, Adleman) Tileset: S Glue: G(g) = 2 G(o) = 2 G(y) = 2 G(r) = 2 G(b) = 1 G(p) = 1 S Temperature: 2 Seed: S

Tile Assembly Model (Rothemund, Winfree, Adleman) Tileset: S Glue: G(g) = 2 G(o) = 2 G(y) = 2 G(r) = 2 G(b) = 1 G(p) = 1 S Temperature: 2 Seed: S

Tile Assembly Model (Rothemund, Winfree, Adleman) Tileset: S Glue: G(g) = 2 G(o) = 2 G(y) = 2 G(r) = 2 G(b) = 1 G(p) = 1 S Temperature: 2 Seed: S

Tile Assembly Model (Rothemund, Winfree, Adleman) Tileset: S Glue: G(g) = 2 G(o) = 2 G(y) = 2 G(r) = 2 G(b) = 1 G(p) = 1 S Temperature: 2 Seed: S

Tile Assembly Model (Rothemund, Winfree, Adleman) Tileset: S Glue: G(g) = 2 G(o) = 2 G(y) = 2 G(r) = 2 G(b) = 1 G(p) = 1 S Temperature: 2 Seed: S

Tile Assembly Model (Rothemund, Winfree, Adleman) Tileset: S Glue: G(g) = 2 G(o) = 2 G(y) = 2 G(r) = 2 G(b) = 1 G(p) = 1 S Temperature: 2 Seed: S

Tile Assembly Model (Rothemund, Winfree, Adleman) Tileset: S Glue: G(g) = 2 G(o) = 2 G(y) = 2 G(r) = 2 G(b) = 1 G(p) = 1 S Temperature: 2 Seed: S

Tile Assembly Model (Rothemund, Winfree, Adleman) Tileset: S Glue: G(g) = 2 G(o) = 2 G(y) = 2 G(r) = 2 G(b) = 1 G(p) = 1 S Temperature: 2 Seed: S

Tile Assembly Model (Rothemund, Winfree, Adleman) Tileset: S Glue: G(g) = 2 G(o) = 2 G(y) = 2 G(r) = 2 G(b) = 1 G(p) = 1 S Temperature: 2 Seed: S TERMINAL

Probabilistic Tile Assembly Model (Becker, Remila, Rapaport) Tileset: S Glue: G(g) = 2 G(o) = 2 G(p) = 2 G(b) = 2 S Temperature: 2 Seed:.1.2.3

Probabilistic Tile Assembly Model (Becker, Remila, Rapaport) Tileset: S Glue: G(g) = 2 G(o) = 2 G(p) = 2 G(b) = 2 S Temperature: 2 Seed: S.1.2.3

Probabilistic Tile Assembly Model (Becker, Remila, Rapaport) Tileset: S Glue: G(g) = 2 G(o) = 2 G(p) = 2 G(b) = 2 S Temperature: 2 Seed: S S S.1.2.3

Probabilistic Tile Assembly Model (Becker, Remila, Rapaport) Tileset: S Glue: G(g) = 2 G(o) = 2 G(p) = 2 G(b) = 2 S Temperature: 2 Seed: S S S =.4

Probabilistic Tile Assembly Model (Becker, Remila, Rapaport) Tileset: S Glue: G(g) = 2 G(o) = 2 G(p) = 2 G(b) = 2 S Temperature: 2 Seed: S S S = =.6

Probabilistic Tile Assembly Model (Becker, Remila, Rapaport) S S S S

Probabilistic Tile Assembly Model (Becker, Remila, Rapaport) S S S S S S S.5

Probabilistic Tile Assembly Model (Becker, Remila, Rapaport) S S S S S S S.5 S S 1 1

Probabilistic Tile Assembly Model (Becker, Remila, Rapaport) S S S S S S S.5 S S 1 1 (.4)(.5)(1)

Probabilistic Tile Assembly Model (Becker, Remila, Rapaport) S S S S S S S.5 S S 1 1 (.4)(.5)(1) + (.4)(.5)(.5)

Probabilistic Tile Assembly Model (Becker, Remila, Rapaport) S S S S S S S.5 S S 1 1 (.4)(.5)(1) + (.4)(.5)(.5) + (.6)(.5)(.5).45

Probabilistic Tile Assembly Model (Becker, Remila, Rapaport) S S S S S S S.5 S S (.6)(.5)(.5) + (.6)(.5)(1).55 (.4)(.5)(1) + (.4)(.5)(.5) + (.6)(.5)(.5).45 (.4)(.5)(.5)

Introduction Models Concentration Independent Coin Flip Big Seed, Temperature 1 Single Seed, Temperature 2 Simulation Simulation Application Unstable Concentrations Summary

Concentration Independent Coin Flipping (TAS, C)

Concentration Independent Coin Flipping (TAS, C) {,,,, }

Concentration Independent Coin Flipping (TAS, C) {,,,, }

Concentration Independent Coin Flipping (TAS, C) {,,,, } P( ) + P( ) + P( ) =.5

Concentration Independent Coin Flipping (TAS, C) {,,,, } P( ) + P( ) + P( ) =.5P( ) + P( ) =.5

Concentration Independent Coin Flipping (TAS, C) {,,,, } P( ) + P( ) + P( ) =.5P( ) + P( ) =.5 For ALL C

.5

P( ) =.5

.7.3.7

.3.7 P( ) =.3 P( ) =.7

Introduction Models Concentration Independent Coin Flip Big Seed, Temperature 1 Single Seed, Temperature 2 Simulation Simulation Application Unstable Concentrations Summary

x y

x y

x y

x y

x y

x y x x+y y y+y 1 P( ) = x x+y y y+y

x y x x+y y y+y 1 P( ) = xy 2y(x+y)

x y x x+y P( ) = xy y y+y y x+y + x y y+y y x+y2y(x+y)

x y x x+y P( ) = xy y y+y y x+y + xy 2 2y(x+y) 2 2y(x+y)

x y P( ) = xy y x+y + xy 2 2y(x+y) 2 x x+x y x+y 2y(x+y)

x y P( ) = xy y x+y + xy 2 2y(x+y) 2 x x+x y x+y y + x x+x y x+y 2y(x+y)

x y P( ) = xy y x+y + xy 2 2y(x+y) 2 x x+x y x+y xy 2 + 2x(x+y) 2 2y(x+y)

P( ) = xy + 2y(x+y) 2 xy 2 + 2x(x+y) 2 2y(x+y) x 2 + 2xy + y 2 2(x+y) 2 = = (x+y) 2 2(x+y) 2 = 1 2 xy 2

Introduction Models Concentration Independent Coin Flip Big Seed, Temperature 1 Single Seed, Temperature 2 Simulation Simulation Application Unstable Concentrations Summary

S 1

S 1 1 2

S

S

S

S

S

S

S

S

S

S

S

S

SSS

SSSSSS

SSSSSSSS

Introduction Models Concentration Independent Coin Flip Big Seed, Temperature 1 Single Seed, Temperature 2 Simulation Simulation Application Unstable Concentrations Summary

Simulation (TAS, C) {,,,, }

Simulation (TAS, C) {,,,, } (TAS’, for all C) {,,,, } with m x n scale factor

Simulation (TAS, C) {,,,, } (TAS’, for all C) {,,,, } with m x n scale factor P(TAS, C) = P(TAS’, for all C)

Simulation (TAS, C) {,,,, } (TAS’, for all C) {,,,, } with m x n scale factor P(TAS, C) = P(TAS’, for all C) TAS’ robustly simulates TAS for C at scale factor m,n

Simulation Unidirectional two-choice linear assembly systems: Grows in one direction from seed Non-determinism between at most 2 tiles

Simulation Unidirectional two-choice linear assembly systems: Grows in one direction from seed Non-determinism between at most 2 tiles S

Simulation Unidirectional two-choice linear assembly systems: Grows in one direction from seed Non-determinism between at most 2 tiles S a b S S

Simulation Unidirectional two-choice linear assembly systems: Grows in one direction from seed Non-determinism between at most 2 tiles S a b S S aS

Simulation Unidirectional two-choice linear assembly systems: Grows in one direction from seed Non-determinism between at most 2 tiles S a b S S aS b Sc b Sd

Simulation Unidirectional two-choice linear assembly systems: Grows in one direction from seed Non-determinism between at most 2 tiles S a b S S aS b Sc b Sd b Sd

Simulation Unidirectional two-choice linear assembly systems: Grows in one direction from seed Non-determinism between at most 2 tiles S a b S S aS b Sc b Sd b Sd For any unidirectional two-choice linear assembly system X, there exists a tile assembly system X’ which robustly simulates X for the uniform concentration distribution at scale factor 5,4.

Simulation S S S

S S S S

S S S SSS

S S S SSS

S S S SSS

S S S SSS

S S S SSS

S S S SSS

S S S SSS

Introduction Models Concentration Independent Coin Flip Big Seed, Temperature 1 Single Seed, Temperature 2 Simulation Simulation Application Unstable Concentrations Summary

Simulation Application There exists a TAS which assembles an expected length N linear assembly using Θ(logN) tile types. (Chandran, Gopalkrishnan, Reif)

Simulation Application There exists a TAS which assembles an expected length N linear assembly using Θ(logN) tile types. (Chandran, Gopalkrishnan, Reif) The construction is a unidirectional two-choice linear assembly system Applies to uniform concentration distribution

Simulation Application There exists a TAS which assembles an expected length N linear assembly using Θ(logN) tile types. (Chandran, Gopalkrishnan, Reif) The construction is a unidirectional two-choice linear assembly system Applies to uniform concentration distribution Corollary to simulation technique: There exists a TAS which assembles a width-4 expected length N assembly for all concentration distributions using O(logN) tile types.

Simulation Application There exists a TAS which assembles an expected length N linear assembly using Θ(logN) tile types. (Chandran, Gopalkrishnan, Reif) The construction is a unidirectional two-choice linear assembly system Applies to uniform concentration distribution Corollary to simulation technique: There exists a TAS which assembles a width-4 expected length N assembly for all concentration distributions using O(logN) tile types. Further, there is no PTAM tile system which generates width-1 expected length N assemblies for all concentration distributions with less than N tile types.

Introduction Models Concentration Independent Coin Flip Big Seed, Temperature 1 Single Seed, Temperature 2 Simulation Simulation Application Unstable Concentrations Summary

Unstable Concentrations (TAS, C) {,,,, } P( ) + P( ) + P( ) =.5P( ) + P( ) =.5

Unstable Concentrations (TAS, C) {,,,, } P( ) + P( ) + P( ) =.5P( ) + P( ) =.5 At each assembly stage, C changes

Unstable Concentrations Impossible in the aTAM (in bounded space)

Unstable Concentrations Impossible in the aTAM (in bounded space) Possible (and easy) in some extended models: aTAM with neg. Interactions, big seed

Unstable Concentrations Impossible in the aTAM (in bounded space) Possible (and easy) in some extended models: aTAM with neg. Interactions, big seed Hexagonal TAM with neg. Interactions

Unstable Concentrations Impossible in the aTAM (in bounded space) Possible (and easy) in some extended models: aTAM with neg. Interactions, big seed Hexagonal TAM with neg. Interactions Polyomino TAM

Unstable Concentrations Impossible in the aTAM (in bounded space) Possible (and easy) in some extended models: aTAM with neg. Interactions, big seed Hexagonal TAM with neg. Interactions Polyomino TAM Geometric TAM, big seed

Summary Unstable Concentrations Impossible in the aTAM (in bounded space) Extended models: Future Work: -Single seed temperature 1 -Other simulations (other TASs/Boolean circuits) -Uniform random number generation -Randomized algorithms Simulation Concentration Independent Coin Flips Large seed, temperature 1 Single seed, temperature 2 S S S S S S S