2001/12/08 by Ming-Yang Kao, Vijay Ramachandran
Computer Science · #cs.CC #cs.CE
published as Algorithms and Computation, 12th International Symposium, ISAAC 2001 Proceedings. Springer LNCS 2223 (2001): 429-440 · 15 pages, 3 figures. Extended abstract included in ISAAC 2001 proceedings
arxiv created 2001/12/08 · arxiv updated 2009/11/30
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.