Programmable Control of Nucleation for Algorithmic Self-assembly

(Extended Abstract)
  • Rebecca Schulman
  • Erik Winfree
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3384)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)CrossRefGoogle Scholar
  2. 2.
    Adleman, L.M.: Personal communication (2004)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Chen, H.-L., Goel, A.: Error free self-assembly using error prone tiles. Accepted to DNA Computing 10Google Scholar
  7. 7.
    Chen, J., Reif, J.H. (eds.): DNA 2003. LNCS, vol. 2943. Springer, Heidelberg (2004)MATHGoogle Scholar
  8. 8.
    Cook, M., Rothemund, P.W.K., Winfree, E.: Self-assembled circuit patterns. In: Chen, J., Reif, J. (eds.) [7], pp. 91–107Google Scholar
  9. 9.
    Davey, R., Garside, J.: From Molecules to Crystallizers. Oxford University Press, Oxford (2000)Google Scholar
  10. 10.
    Dill, K.A., Bromberg, S.: Molecular Driving Forces: Statistical Thermodynamics in Chemistry and Biology. Garland Science, New York (2002)Google Scholar
  11. 11.
    Egan, G.: Wang’s carpets. In: Bear, G. (ed.) New Legends, Legend, London (1995)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    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)CrossRefGoogle Scholar
  14. 14.
    Reif, J.H., Sahu, S., Yin, P.: Compact error-resilient computational DNA tiling assemblies. Accepted to DNA Computing 10Google Scholar
  15. 15.
    Rothemund, P.W.K.: Using lateral capillary forces to compute by self-assembly. Proceedings of the National Academy of Sciences 97, 984–989 (2000)CrossRefGoogle Scholar
  16. 16.
    Rothemund, P.W.K., Papadakis, N., Winfree, E.: Algorithmic self-assembly of DNA Sierpinski triangles (2004) (submitted) Google Scholar
  17. 17.
    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–125Google Scholar
  18. 18.
    Schulman, R., Winfree, E.: Kinetic models of DNA tile self-assembly. In preparationGoogle Scholar
  19. 19.
    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)Google Scholar
  20. 20.
    Winfree, E.: Simulations of computing by self-assembly. Technical Report CS-TR:1998.22, Caltech (1998)Google Scholar
  21. 21.
    Winfree, E., Bekbolatov, R.: Proofreading tile sets: Error-correction for algorithmic self-assembly. In: Chen, J., Reif, J. (eds.) [7], pp. 126–144Google Scholar
  22. 22.
    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)Google Scholar
  23. 23.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Rebecca Schulman
    • 1
  • Erik Winfree
    • 1
  1. 1.California Institute of TechnologyPasadenaUSA

Personalised recommendations