The program-size complexity of self-assembled squares (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Running time and program size for self-assembled squares
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Combinatorial optimization problems in self-assembly
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Algorithmic self-assembly of dna
Algorithmic self-assembly of dna
Complexities for Generalized Models of Self-Assembly
SIAM Journal on Computing
Reducing tile complexity for self-assembly through temperature programming
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A microfluidic device for DNA tile self-assembly
DNA'05 Proceedings of the 11th international conference on DNA Computing
Complexity of self-assembled shapes
DNA'04 Proceedings of the 10th international conference on DNA computing
The Tile Complexity of Linear Assemblies
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Polyomino-safe DNA self-assembly via block replacement
Natural Computing: an international journal
Polyominoes simulating arbitrary-neighborhood zippers and tilings
Theoretical Computer Science
Computing maximal Kleene closures that are embeddable in a given constrained DNA language
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Efficient 3-SAT algorithms in the tile assembly model
Natural Computing: an international journal
Hi-index | 0.00 |
We introduce staged self-assembly of Wang tiles, where tiles can be added dynamically in sequence and where intermediate constructions can be stored for later mixing. This model and its various constraints and performance measures are motivated by a practical nanofabrication scenario through protein-based bioengineering. Staging allows us to break through the traditional lower bounds in tile self-assembly by encoding the shape in the staging algorithm instead of the tiles. All of our results are based on the practical assumption that only a constant number of glues, and thus only a constant number of tiles, can be engineered, as each new glue type requires significant biochemical research and experiments. Under this assumption, traditional tile self-assembly cannot even manufacture an n×n square; in contrast, we show how staged assembly enables manufacture of arbitrary orthogonal shapes in a variety of precise formulations of the model.