DNA self-assembly for constructing 3D boxes (Extended Abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2223 LNCS, Issue , 2001, Pages 429-441

  Ming Yang, Kao ^a   Ramachandran, Vijay ^b  

^a Northwestern University   (United States)

^b Yale University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

3D STRUCTURE; ALGORITHMIC TECHNIQUES; ASSEMBLY MODEL; DNA SELF-ASSEMBLY; EXTENDED ABSTRACTS; HOLLOW CUBES; MEASURES OF COMPLEXITY; 3-D NANOSTRUCTURES; TILE ASSEMBLY MODELS;

ALGORITHMS; BUILDING MATERIALS; COMPUTATION THEORY; DNA; GENES; MATHEMATICAL MODELS; NANOSTRUCTURES; NUCLEIC ACIDS; SELF ASSEMBLY; THREE DIMENSIONAL COMPUTER GRAPHICS;

THREE DIMENSIONAL; THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 71049184062     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45678-3_37     Document Type: Conference Paper

References (13)

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. 429, 430
2. A. Condon, R. M. Corn, and A. Marathe. On combinatorial DNA word design. In Winfree and Gifford [12]. 433, 436
3. T.-J. Fu and N. C. Seeman. DNA double-crossover molecules. Biochemistry, 32:3211-3220, 1993. 429, 432
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]. 430
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. 429, 432
6. I. V. Markov. Crystal Growth for Beginners: Fundamentals of Nucleation, Crystal Growth, and Epitaxy. World Scientific, Singapore, 1995. 435
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. 430, 431, 433, 434, 435, 437, 439
8. N. C. Seeman. Nucleic-acid junctions and lattices. Journal of Theoretical Biology, 2:237-247, 1982. 429, 432
9. H. Wang. Proving theorems by pattern recognition. Bell System Technical Journal, 40:1-42, 1961. 432
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. 430
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. 430
12. E. Winfree and D. Gifford, editors. Prel i minary Proceedi ngs, Fi f th International Meeting on DNA Based Computers, Cambridge, Massachusetts, 14-15 June 1999. DIMACS. 440
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. 430