time optimal self-assembly of squares and cubesnschaban/mpri/2014-2015/2.11.1/cube.pdftime optimal...
TRANSCRIPT
![Page 1: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/1.jpg)
Time optimal Self-assembly of
Squares and CubesFlorent Becker, Eric Rémila
IXXI - LIP, Ecole normale supérieure de Lyon, France
Nicolas SchabanelCNRS - CMM, Universidad de Chile
![Page 2: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/2.jpg)
DNA Algorithmic Self-assembly
Introduced by Winfree et al for the design of successful real experimentsMain interest: the shape assembles by itself by a one-pot reaction
Cred
its: K
. Fuj
ibay
ashi
, R. H
aria
di, S
.H. P
ark,
E. W
infre
e &
S. M
urat
a
![Page 3: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/3.jpg)
Other strategy:DNA origami
Rothemund (2006)
Credits: Paul W. K. Rothemund
![Page 4: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/4.jpg)
Other strategy:DNA origami
Rothemund (2006)Cons: No computational aspectEach staple is different and has to be synthesized independently
Credits: Paul W. K. Rothemund
![Page 5: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/5.jpg)
DNA Algorithmic Self-assembly
1. Thermal cyclerHot / less hot cycles for exponential duplication of the DNA strands by Polymerase Chain Reaction (PCR)
=> the tiles ...
2. One-pot reactionMixing the tiles and letting the
solution cool down to room temperature
![Page 6: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/6.jpg)
Coping with errors
Facet errorsInsufficient attachment: attach by one single bond and later on fixed in place by another tile.Growth errors: correctly matching site and a mismatch.Merging of independent agregates.Auto-start of self-assembly without the seed.
PropositionsProof-reading construction.Error-correcting code.Avoiding open binding sites.Forcing an order to minimize open binding.
![Page 7: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/7.jpg)
Algorithmic modelof the experiments
Tile system (Winfree, 1998)
• a finite set of tiles with glues which have strength
• a special tile known as the seed• a temperature (= 2 in practise)
![Page 8: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/8.jpg)
Algorithmic modelof the experiments
Tile system (Winfree, 1998)
• a finite set of tiles with glues which have strength
• a special tile known as the seed• a temperature (= 2 in practise)
red glue of strength 2
blue glue of strength 1
white glue of strength 0
![Page 9: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/9.jpg)
Algorithmic modelof the experiments
Tile system (Winfree, 1998)
• a finite set of tiles with glues which have strength
• a special tile known as the seed• a temperature (= 2 in practise)
red glue of strength 2
blue glue of strength 1
white glue of strength 0
the seed
![Page 10: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/10.jpg)
Algorithmic modelof the experiments
Tile system (Winfree, 1998)
• a finite set of tiles with glues which have strength
• a special tile known as the seed• a temperature (= 2 in practise)
red glue of strength 2
blue glue of strength 1
white glue of strength 0
the seed
![Page 11: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/11.jpg)
Algorithmic modelof the experiments
Tile system (Winfree, 1998)
• a finite set of tiles with glues which have strength
• a special tile known as the seed• a temperature (= 2 in practise)
red glue of strength 2
blue glue of strength 1
white glue of strength 0
the seed
X
![Page 12: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/12.jpg)
Algorithmic modelof the experiments
Tile system (Winfree, 1998)
• a finite set of tiles with glues which have strength
• a special tile known as the seed• a temperature (= 2 in practise)
red glue of strength 2
blue glue of strength 1
white glue of strength 0
the seed
![Page 13: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/13.jpg)
Algorithmic modelof the experiments
Tile system (Winfree, 1998)
• a finite set of tiles with glues which have strength
• a special tile known as the seed• a temperature (= 2 in practise)
red glue of strength 2
blue glue of strength 1
white glue of strength 0
the seed
![Page 14: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/14.jpg)
Algorithmic modelof the experiments
Tile system (Winfree, 1998)
• a finite set of tiles with glues which have strength
• a special tile known as the seed• a temperature (= 2 in practise)
red glue of strength 2
blue glue of strength 1
white glue of strength 0
the seed
XTotal bond strength < T°
= 2
![Page 15: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/15.jpg)
Algorithmic modelof the experiments
Tile system (Winfree, 1998)
• a finite set of tiles with glues which have strength
• a special tile known as the seed• a temperature (= 2 in practise)
red glue of strength 2
blue glue of strength 1
white glue of strength 0
the seed
![Page 16: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/16.jpg)
Algorithmic modelof the experiments
Tile system (Winfree, 1998)
• a finite set of tiles with glues which have strength
• a special tile known as the seed• a temperature (= 2 in practise)
red glue of strength 2
blue glue of strength 1
white glue of strength 0
the seed
![Page 17: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/17.jpg)
Algorithmic modelof the experiments
Tile system (Winfree, 1998)
• a finite set of tiles with glues which have strength
• a special tile known as the seed• a temperature (= 2 in practise)
red glue of strength 2
blue glue of strength 1
white glue of strength 0
the seed
![Page 18: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/18.jpg)
Algorithmic modelof the experiments
Tile system (Winfree, 1998)
• a finite set of tiles with glues which have strength
• a special tile known as the seed• a temperature (= 2 in practise)
red glue of strength 2
blue glue of strength 1
white glue of strength 0
the seed
![Page 19: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/19.jpg)
On self-assembly
• Algorithmic Self-Assembly, E. Winfree (1998)
• Theory and Experiments in Algorithmic Self-Assembly, P. Rothemund (2001)
• Adlemann, Cheng, Goel & Huang (2001)Any shape can be assembled with O(K/log K) tiles (after some discrete dilatation) where K = Kolmogorov complexity of the shape
• Becker, Rapaport & Rémila (2006)Self-assembling shapes with a minimum number of tiles
![Page 20: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/20.jpg)
An example: Assembling a square
the seed
the
tile
s -
Tem
per
atu
re =
2
![Page 21: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/21.jpg)
An example: Assembling a square
the seed
the
tile
s -
Tem
per
atu
re =
2
![Page 22: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/22.jpg)
An example: Assembling a square
the seed
the
tile
s -
Tem
per
atu
re =
2
![Page 23: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/23.jpg)
An example: Assembling a square
the seed
the
tile
s -
Tem
per
atu
re =
2
![Page 24: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/24.jpg)
An example: Assembling a square
the seed
the
tile
s -
Tem
per
atu
re =
2
![Page 25: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/25.jpg)
An example: Assembling a square
the seed
the
tile
s -
Tem
per
atu
re =
2
![Page 26: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/26.jpg)
An example: Assembling a square
the seed
the
tile
s -
Tem
per
atu
re =
2
![Page 27: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/27.jpg)
An example: Assembling a square
the seed
the
tile
s -
Tem
per
atu
re =
2
![Page 28: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/28.jpg)
An example: Assembling a square
the seed
the
tile
s -
Tem
per
atu
re =
2
![Page 29: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/29.jpg)
An example: Assembling a square
the seed
the
tile
s -
Tem
per
atu
re =
2
No more tiles can be attached
![Page 30: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/30.jpg)
An example: Assembling a square
the seed
the
tile
s -
Tem
per
atu
re =
2
Longest chain of dependencies
= 3n-3
No more tiles can be attached
![Page 31: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/31.jpg)
Facts
Irrevocability.As opposed to CA, the “state/tile” of a cell cannot change
Everything that can bind, may bind so be careful with signals self-ignition.
Guaranteeing an order. Being sure of the predecessors of each cell to guarantee the global behavior
Only one “main signal” per coordinate. Otherwise it is not possible to guarantee the predecessors
Some consequences
Filling tiles carry information and are not interchangeable.As opposed to quiescent states in CA or “blank tiles” in tilings
There exists flows of information within the shape.Signals cannot go against the flows but still have to intersect predictably
Assembling vs Tiling & Cellular Automata
![Page 32: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/32.jpg)
Facts
Irrevocability.As opposed to CA, the “state/tile” of a cell cannot change
Everything that can bind, may bind so be careful with signals self-ignition.
Guaranteeing an order. Being sure of the predecessors of each cell to guarantee the global behavior
Only one “main signal” per coordinate. Otherwise it is not possible to guarantee the predecessors
Some consequences
Filling tiles carry information and are not interchangeable.As opposed to quiescent states in CA or “blank tiles” in tilings
There exists flows of information within the shape.Signals cannot go against the flows but still have to intersect predictably
Assembling vs Tiling & Cellular Automata
![Page 33: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/33.jpg)
Facts
Irrevocability.As opposed to CA, the “state/tile” of a cell cannot change
Everything that can bind, may bind so be careful with signals self-ignition.
Guaranteeing an order. Being sure of the predecessors of each cell to guarantee the global behavior
Only one “main signal” per coordinate. Otherwise it is not possible to guarantee the predecessors
Some consequences
Filling tiles carry information and are not interchangeable.As opposed to quiescent states in CA or “blank tiles” in tilings
There exists flows of information within the shape.Signals cannot go against the flows but still have to intersect predictably
Assembling vs Tiling & Cellular Automata
![Page 34: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/34.jpg)
Facts
Irrevocability.As opposed to CA, the “state/tile” of a cell cannot change
Everything that can bind, may bind so be careful with signals self-ignition.
Guaranteeing an order. Being sure of the predecessors of each cell to guarantee the global behavior
Only one “main signal” per coordinate. Otherwise it is not possible to guarantee the predecessors
Some consequences
Filling tiles carry information and are not interchangeable.As opposed to quiescent states in CA or “blank tiles” in tilings
There exists flows of information within the shape.Signals cannot go against the flows but still have to intersect predictably
Assembling vs Tiling & Cellular Automata
![Page 35: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/35.jpg)
Facts
Irrevocability.As opposed to CA, the “state/tile” of a cell cannot change
Everything that can bind, may bind so be careful with signals self-ignition.
Guaranteeing an order. Being sure of the predecessors of each cell to guarantee the global behavior
Only one “main signal” per coordinate. Otherwise it is not possible to guarantee the predecessors
Some consequences
Filling tiles carry information and are not interchangeable.As opposed to quiescent states in CA or “blank tiles” in tilings
There exists flows of information within the shape.Signals cannot go against the flows but still have to intersect predictably
Assembling vs Tiling & Cellular Automata
![Page 36: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/36.jpg)
Facts
Irrevocability.As opposed to CA, the “state/tile” of a cell cannot change
Everything that can bind, may bind so be careful with signals self-ignition.
Guaranteeing an order. Being sure of the predecessors of each cell to guarantee the global behavior
Only one “main signal” per coordinate. Otherwise it is not possible to guarantee the predecessors
Some consequences
Filling tiles carry information and are not interchangeable.As opposed to quiescent states in CA or “blank tiles” in tilings
There exists flows of information within the shape.Signals cannot go against the flows but still have to intersect predictably
Assembling vs Tiling & Cellular Automata
![Page 37: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/37.jpg)
Facts
Irrevocability.As opposed to CA, the “state/tile” of a cell cannot change
Everything that can bind, may bind so be careful with signals self-ignition.
Guaranteeing an order. Being sure of the predecessors of each cell to guarantee the global behavior
Only one “main signal” per coordinate. Otherwise it is not possible to guarantee the predecessors
Some consequences
Filling tiles carry information and are not interchangeable.As opposed to quiescent states in CA or “blank tiles” in tilings
There exists flows of information within the shape.Signals cannot go against the flows but still have to intersect predictably
Assembling vs Tiling & Cellular Automata
![Page 38: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/38.jpg)
Ordered Tilesystem
A tilesystem is ordered if for each production, the predecesors cells of each cell are independent of the construction path.
Consequences
• No one has more than T° predecessors.
• The only non-determinism relies in the choice of the tile to attach, which determines which shape is assembled.
![Page 39: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/39.jpg)
Example of an ordered tile system
the
tile
s -
Tem
per
atu
re =
2
the seed
![Page 40: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/40.jpg)
Example of an ordered tile system
the
tile
s -
Tem
per
atu
re =
2
the seed
![Page 41: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/41.jpg)
Example of an ordered tile system
the
tile
s -
Tem
per
atu
re =
2
the seed
![Page 42: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/42.jpg)
RankRank. The rank of a site (i,j) in a given shape is the length of its longest chain of dependancies from the seed.
10 9 8 7 8
7 6 5 6 9
4 3 4 7 101 2 5 8 11
0 3 6 9 12
![Page 43: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/43.jpg)
RankRank. The rank of a site (i,j) in a given shape is the length of its longest chain of dependancies from the seed.
10 9 8 7 8
7 6 5 6 9
4 3 4 7 101 2 5 8 11
0 3 6 9 12
![Page 44: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/44.jpg)
Time model
Poisson Markov Chain Model. Each tile appears at each unoccupied site according to some Poisson process at a rate proportional to its concentration.
Only matching tile with enough bonds remains attached to the current agregate.
![Page 45: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/45.jpg)
Time & order
Theorem. [Adleman et al, 2001] The expected time to build a shape P is:
O(c • rank(P)) where c only depends on the concentrations and rank(P) is a highest rank in the shape P.
⇒ we focus on minimizing the highest rank
![Page 46: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/46.jpg)
Real time
Lower bounding the construction time.Given that tiles are placed one next to the others, ||P||1 is a lower bound on the highest rank of a site of a shape P.
Real time construction. A shape P is built in real time if
the highest rank of a site = ||P||1
For the n x n square Sn : ||Sn||1 = 2n - 2
![Page 47: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/47.jpg)
Skeletonunderstanding the flow of information
Skeleton. The skeleton of a shape in an ordered tile system is the set of the sites with at most one predecesor.
the x-skeleton in blueopens the columns
the y-skeleton in orange opens the rows
![Page 48: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/48.jpg)
Skeletonunderstanding the flow of information
Skeleton. The skeleton of a shape in an ordered tile system is the set of the sites with at most one predecesor.
the x-skeleton in blueopens the columns
the y-skeleton in orange opens the rows
![Page 49: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/49.jpg)
Assembling aSquare
in Real Time
![Page 50: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/50.jpg)
Lower bounding the rank
Let (i, ai)i≥0 and (bj, j)j≥0 be the x- and y-skeletons
Since the x- and y-skeletons sites are the first tiled on each column and each row respectively, then for each site (i,j):
seed
(bj , j)
(i, ai)
(i , j)
rank(bj , j) rank(i, ai)
|i - bj|
| j - ai|
rank(i, j) ! max{rank(i, ai) + |j ! ai|, rank(bj , j) + |i! bj |}
![Page 51: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/51.jpg)
Where should be the skeleton?
the x-skeleton cannot go above n/2the y-skeleton cannot go to the right of n/2
n/2
(n, 0)
![Page 52: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/52.jpg)
Rank function induced by the skeleton
The skeleton: and
The rank induced:rank(u) = max{||ai||1 + ||u! ai||1, |bj ||1 + ||u! bj ||1)
ai = (i, !i/2") bj = (!j/2", j)
y-skeleton
x-skeletonrank(i, j) = i + j
rank(i, j) = i + 2!i/2" # j > ||i, j||1
rank(i, j) = j + 2!j/2" # i
on-time zone
![Page 53: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/53.jpg)
Order induced by the skeleton
Key to construct the tileset:
1) being able to guess the types of its successors from its own predecesors
2) synchronizing the two parts of the skeleton
![Page 54: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/54.jpg)
The resulting tileset
![Page 55: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/55.jpg)
The resulting tileset
![Page 56: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/56.jpg)
The resulting tileset
![Page 57: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/57.jpg)
The resulting tileset
![Page 58: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/58.jpg)
The resulting tileset
![Page 59: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/59.jpg)
Running the tileset
![Page 60: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/60.jpg)
Running the tileset
![Page 61: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/61.jpg)
Running the tileset
![Page 62: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/62.jpg)
Running the tileset
![Page 63: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/63.jpg)
Running the tileset
![Page 64: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/64.jpg)
Running the tileset
![Page 65: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/65.jpg)
Running the tileset
![Page 66: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/66.jpg)
Running the tileset
![Page 67: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/67.jpg)
Running the tileset
![Page 68: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/68.jpg)
Running the tileset
![Page 69: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/69.jpg)
Running the tileset
![Page 70: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/70.jpg)
Running the tileset
![Page 71: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/71.jpg)
Running the tileset
![Page 72: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/72.jpg)
Running the tileset
![Page 73: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/73.jpg)
Running the tileset
![Page 74: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/74.jpg)
Running the tileset
![Page 75: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/75.jpg)
Running the tileset
![Page 76: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/76.jpg)
Running the tileset
![Page 77: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/77.jpg)
Running the tileset
![Page 78: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/78.jpg)
Running the tileset
![Page 79: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/79.jpg)
Running the tileset
![Page 80: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/80.jpg)
Running the tileset
![Page 81: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/81.jpg)
Assembling cubes in real time
![Page 82: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/82.jpg)
The skeleton &its rank function
The skeleton.
The rank function induced.
!""#
""$
ai = (i, !i/2", !i/2")
bj = (!j/2", j, !j/2")
ck = (!k/2", !k/2", k)
rank(u) = max
!""#
""$
||ai||1 + ||u! ai||1||bj ||1 + ||u! bj ||1||ck||1 + ||u! ck||1
x-skeleton
y-skeleton
z-skeleton
![Page 83: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/83.jpg)
Variations of the rank function
Key step: determining the successors from the predecessors
![Page 84: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/84.jpg)
Variations of the rank function
Key step: determining the successors from the predecessors
![Page 85: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/85.jpg)
Synchronizing the 3 skeleton branches
Use again the on-time zone
![Page 86: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/86.jpg)
Demo time!
![Page 87: Time optimal Self-assembly of Squares and Cubesnschaban/MPRI/2014-2015/2.11.1/cube.pdfTime optimal Self-assembly of Squares and Cubes Florent Becker, Eric Rémila IXXI - LIP, Ecole](https://reader031.vdocuments.us/reader031/viewer/2022011812/5e2e55f6a24f7a1a68163457/html5/thumbnails/87.jpg)
Concluding remarksRelevance of local precedence order analysis
• First, analyzing the flow of information
• Second, deducing the tile systems
• Allow easier certification of 3D tilesystems
• New kind of inter-signal relationships
Some open questions
• Error managing
• Chemical realization of our scheme (help wanted!)
• Applying our scheme to more involved shapes (convex polyhedron for instance)