DNA Self-Assembly For Constructing 3D Boxes

(Extended Abstract)
  • Ming-Yang Kao 
  • Vijay Ramachandran
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2223)


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 superset 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.


Tile Type Random Assembly Tile Assembly Model Nanostructure Fabrication Base Strip 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. Chen and N. C. Seeman. The synthesis from DNA of a molecule with the connectivity of a cube. Nature, 350:631–633, 1991.CrossRefGoogle Scholar
  2. 2.
    A. Condon, R. M. Corn, and A. Marathe. On combinatorial DNA word design. In Winfree and Gifford [12].Google Scholar
  3. 3.
    T.-J. Fu and N. C. Seeman. DNA double-crossover molecules. Biochemistry, 32:3211–3220, 1993.CrossRefGoogle Scholar
  4. 4.
    T. H. LaBean, E. Winfree, and J. H. Reif. Experimental progress in computation by self-assembly of DNA tilings. In Winfree and Gifford [12].Google Scholar
  5. 5.
    T. H. LaBean, H. Yan, J. Kopatsch, F. Liu, E. Winfree, H. Reif, and N. Seeman. The construction, analysis, ligation and self-assembly of DNA triple crossover complexes. J. Am. Chem. Soc., 122:1848–1860, 2000.CrossRefGoogle Scholar
  6. 6.
    I. V. Markov. Crystal Growth for Beginners: Fundamentals of Nucleation, Crystal Growth, and Epitaxy. World Scientific, Singapore, 1995.Google Scholar
  7. 7.
    P. Rothemund and E. Winfree. The program-size complexity of self-assembled squares. In F. F. Yao, editor, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, 21–23 May 2000. ACM Special Interest Group on Algorithms and Computation Theory.Google Scholar
  8. 8.
    N. C. Seeman. Nucleic-acid junctions and lattices. Journal of Theoretical Biology, 2:237–247, 1982.CrossRefGoogle Scholar
  9. 9.
    H. Wang. Proving theorems by pattern recognition. Bell System Technical Journal, 40:1–42, 1961.CrossRefGoogle Scholar
  10. 10.
    E. Winfree. On the computational power of DNA annealing and ligation. In E. B. Baum and R. J. Lipton, editors, DNA Based Computers, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, pages 199–210. American Mathematical Society, May 1995.Google Scholar
  11. 11.
    E. Winfree, T. Eng, and G. Rozenberg. String tile models for DNA computing by self-assembly. In A. Condon and G. Rozenberg, editors, DNA Based Computers VI, Leiden, The Netherlands, 13–17 June 2000. Leiden Center for Natural Computing.Google Scholar
  12. 12.
    E. Winfree and D. Gifford, editors. Preliminary Proceedings, Fifth International Meeting on DNA Based Computers, Cambridge, Massachusetts, 14–15 June 1999. DIMACS.Google Scholar
  13. 13.
    E. Winfree, F. Liu, L. A. Wenzler, and N. C. Seeman. Design and self-assembly of two-dimensional DNA crystals. Nature, 394:539–544, 1998.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Ming-Yang Kao 
    • 1
  • Vijay Ramachandran
    • 2
  1. 1.Department of Computer ScienceNorthwestern UniversityEvanstonUSA
  2. 2.Department of Computer ScienceYale UniversityNew HavenUSA

Personalised recommendations