Computer Science – Computational Complexity
Scientific paper
2001-12-08
Algorithms and Computation, 12th International Symposium, ISAAC 2001 Proceedings. Springer LNCS 2223 (2001): 429-440
Computer Science
Computational Complexity
15 pages, 3 figures. Extended abstract included in ISAAC 2001 proceedings
Scientific paper
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.
Kao Ming-Yang
Ramachandran Vijay
No associations
LandOfFree
DNA Self-Assembly For Constructing 3D Boxes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with DNA Self-Assembly For Constructing 3D Boxes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and DNA Self-Assembly For Constructing 3D Boxes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-317712