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
On the Decidability of Self-Assembly of Infinite Ribbons
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Theory and experiments in algorithmic self-assembly
Theory and experiments in algorithmic self-assembly
Complexities for generalized models of self-assembly
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Invadable self-assembly: combining robustness with efficiency
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Reducing tile complexity for self-assembly through temperature programming
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Complexity of graph self-assembly in accretive systems and self-destructible systems
DNA'05 Proceedings of the 11th international conference on DNA Computing
Complexity of compact proofreading for self-assembled patterns
DNA'05 Proceedings of the 11th international conference on DNA Computing
Self-replication and evolution of DNA crystals
ECAL'05 Proceedings of the 8th European conference on Advances in Artificial Life
A method of error suppression for self-assembling DNA tiles
DNA'04 Proceedings of the 10th international conference on DNA computing
Compact error-resilient computational DNA tiling assemblies
DNA'04 Proceedings of the 10th international conference on DNA computing
Programmable control of nucleation for algorithmic self-assembly
DNA'04 Proceedings of the 10th international conference on DNA computing
Complexity of self-assembled shapes
DNA'04 Proceedings of the 10th international conference on DNA computing
Complexity of graph self-assembly in accretive systems and self-destructible systems
Theoretical Computer Science
Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions
Natural Computing: an international journal
On stoichiometry for the assembly of flexible tile DNA complexes
Natural Computing: an international journal
Complexity of graph self-assembly in accretive systems and self-destructible systems
DNA'05 Proceedings of the 11th international conference on DNA Computing
Spectrum of a pot for DNA complexes
DNA'06 Proceedings of the 12th international conference on DNA Computing
Theory and applications of DNA codeword design
TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
| Hi-index | 0.00 |
We propose a self-assembly model in which the glue strength between two juxtaposed tiles is a function of the time they have been in neighboring positions. We then present an implementation of our model using strand displacement reactions on DNA tiles. Under our model, we can demonstrate and study catalysis and self-replication in the tile assembly. We then study the tile complexity for assembling shapes in our model and show that a thin rectangle of size k ×N can be assembled using $O(\frac{\log N}{\log \log N})$ types of tiles.