The program-size complexity of self-assembled squares (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Distributed agreement in tile self-assembly
Natural Computing: an international journal
On stoichiometry for the assembly of flexible tile DNA complexes
Natural Computing: an international journal
Expectation and variance of self-assembled graph structures
DNA'05 Proceedings of the 11th international conference on DNA Computing
A computational model for self-assembling flexible tiles
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Spectrum of a pot for DNA complexes
DNA'06 Proceedings of the 12th international conference on DNA Computing
A method of error suppression for self-assembling DNA tiles
DNA'04 Proceedings of the 10th international conference on DNA computing
| Hi-index | 0.00 |
We propose a mathematical model of DNA self-assembly using 2D tiles to form 3D nanostructures. This is the first work to combine studies in self-assembly and nanotechnology in 3D, just as Rothemund and Winfree did in the 2D case. Our model is a more precise super-set of their Tile Assembly Model that facilitates building scalable 3D molecules. Under our model, we present algorithms to build a hollow cube, which is intuitively one of the simplest 3D structures to construct. We also introduce five basic measures of complexity to analyze these algorithms. Our model and algorithmic techniques are applicable to more complex 2D and 3D nanostructures.