Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
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.
KeywordsTile System Decomposition Tree Kolmogorov Complexity Full Connectivity Stage Complexity
Unable to display preview. Download preview PDF.
- [ACG+02]Adleman, L., Cheng, Q., Goel, A., Huang, M.-D., Kempe, D., de Espanés, P.M., Rothemund, P.W.K.: Combinatorial optimization problems in self-assembly. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing (electronic), pp. 23–32. ACM Press, New York (2002)CrossRefGoogle Scholar
- [ACGH01]Adleman, L., Cheng, Q., Goel, A., Huang, M.-D.: Running time and program size for self-assembled squares. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 740–748. ACM Press, New York (2001)Google Scholar
- [Adl00]Adleman, L.M.: Toward a mathematical theory of self-assembly. Technical Report 00-722, Department of Computer Science, University of Southern California (January 2000)Google Scholar
- [Rei99]Reif, J.: Local parallel biomolecular computation. In: Proc. DNA-Based Computers, pp. 217–254 (1999)Google Scholar
- [RW00]Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 459–468. ACM Press, New York (2000)Google Scholar
- [See98]Seeman, N.C.: DNA nanotechnology. In: Siegel, R.W., Hu, E., Roco, M.C. (eds.) WTEC Workshop Report on R&D Status and Trends in Nanoparticles, Nanostructured Materials, and Nanodevices in the United States (January 1998)Google Scholar
- [SKFM05]Somei, K., Kaneda, S., Fujii, T., Murata, S.: A microfluidic device for dna tile self-assembly. In: DNA, pp. 325–335 (2005)Google Scholar
- [SW04]Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA Computing. LNCS, vol. 3384, pp. 344–354. Springer, Heidelberg (2005)Google Scholar
- [Wan61]Wang, H.: Proving theorems by pattern recognition—II. The Bell System Technical Journal 40(1), 1–41 (1961)Google Scholar
- [Win98]Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology, Pasadena (1998)Google Scholar