Abstract
Algorithmic self-assembly has been proposed as a mechanism for autonomous DNA computation and for bottom-up fabrication of complex nanodevices. Whereas much previous work has investigated self-assembly programs using an abstract model of irreversible, errorless assembly, experimental studies as well as more sophisticated reversible kinetic models indicate that algorithmic self-assembly is subject to several kinds of errors. Previously, it was shown that proofreading tile sets can reduce the occurrence of mismatch and facet errors. Here, we introduce the zig-zag tile set, which can reduce the occurrence of spurious nucleation errors. The zig-zag tile set takes advantage of the fact that assemblies must reach a critical size before their growth becomes favorable. By using a zig-zag tile set of greater width, we can increase the critical size of spurious assemblies without increasing the critical size of correctly seeded assemblies, exponentially reducing the spurious nucleation rate. In combination with proofreading results, this result indicates that algorithmic self-assembly can be performed with low error rates without a significant reduction in assembly speed. Furthermore, our zig-zag boundaries suggest methods for exquisite detection of DNA strands and for the replication of inheritable information without the use of enzymes.
A preprint of the full paper can be found at http://arxiv.org.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)
Adleman, L.M.: Personal communication (2004)
Adleman, L.M., Cheng, Q., Goel, A., Huang, M.-D.: Running time and program size for self-assembled squares. In: Symposium on the Theory of Computing (STOC) (2001)
Adleman, L.M., Kari, J., Kari, L., Reishus, D.: On the decidability of self-assembly of infinite ribbons. In: Symposium on Foundations of Computer Science (FOCS), vol. 43, p. 530 (2002)
Cairns-Smith, A.G.: The life puzzle: on crystals and organisms and on the possibility of a crystal as an ancestor. Oliver and Boyd, New York (1971)
Chen, H.-L., Goel, A.: Error free self-assembly using error prone tiles. Accepted to DNA Computing 10
Chen, J., Reif, J.H. (eds.): DNA 2003. LNCS, vol. 2943. Springer, Heidelberg (2004)
Cook, M., Rothemund, P.W.K., Winfree, E.: Self-assembled circuit patterns. In: Chen, J., Reif, J. (eds.) [7], pp. 91–107
Davey, R., Garside, J.: From Molecules to Crystallizers. Oxford University Press, Oxford (2000)
Dill, K.A., Bromberg, S.: Molecular Driving Forces: Statistical Thermodynamics in Chemistry and Biology. Garland Science, New York (2002)
Egan, G.: Wang’s carpets. In: Bear, G. (ed.) New Legends, Legend, London (1995)
Lagoudakis, M.G., LaBean, T.H.: 2-D DNA self-assembly for satisfiability. In: Winfree, E., Gifford, D.K. (eds.) DNA Based Computers V, Providence, RI. DIMACS, vol. 54, pp. 141–154. American Mathematical Society (2000)
Mao, C., LaBean, T.H., Reif, J.H., Seeman, N.C.: Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature 407(6803), 493–496 (2000)
Reif, J.H., Sahu, S., Yin, P.: Compact error-resilient computational DNA tiling assemblies. Accepted to DNA Computing 10
Rothemund, P.W.K.: Using lateral capillary forces to compute by self-assembly. Proceedings of the National Academy of Sciences 97, 984–989 (2000)
Rothemund, P.W.K., Papadakis, N., Winfree, E.: Algorithmic self-assembly of DNA Sierpinski triangles (2004) (submitted)
Schulman, R., Lee, S., Papadakis, N., Winfree, E.: One dimensional boundaries for DNA tile self-assembly. In: Chen, J., Reif, J. (eds.) [7], pp. 108–125
Schulman, R., Winfree, E.: Kinetic models of DNA tile self-assembly. In preparation
Winfree, E.: On the computational power of DNA annealing and ligation. In: Lipton, R.J., Baum, E.B. (eds.) DNA Based Computers, Providence, RI. DIMACS, vol. 27, pp. 199–221. American Mathematical Society (1996)
Winfree, E.: Simulations of computing by self-assembly. Technical Report CS-TR:1998.22, Caltech (1998)
Winfree, E., Bekbolatov, R.: Proofreading tile sets: Error-correction for algorithmic self-assembly. In: Chen, J., Reif, J. (eds.) [7], pp. 126–144
Winfree, E., Yang, X., Seeman, N.C.: Universal computation via self-assembly of DNA: Some theory and experiments. In: Landweber, L.F., Baum, E.B. (eds.) DNA Based Computers II. DIMACS, vol. 44, pp. 191–213. American Mathematical Society, Providence (1998)
Yan, H., LaBean, T.H., Feng, L., Reif, J.H.: Directed nucleation assembly of DNA tile complexes for barcode-patterned lattices. Proc. Nat. Acad. Sci. USA 100(14), 8103–8108 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schulman, R., Winfree, E. (2005). Programmable Control of Nucleation for Algorithmic Self-assembly. In: Ferretti, C., Mauri, G., Zandron, C. (eds) DNA Computing. DNA 2004. Lecture Notes in Computer Science, vol 3384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493785_28
Download citation
DOI: https://doi.org/10.1007/11493785_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26174-2
Online ISBN: 978-3-540-31844-6
eBook Packages: Computer ScienceComputer Science (R0)