Strict self-assembly of discrete Sierpinski triangles

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

Volumn 4497 LNCS, Issue , 2007, Pages 455-464

  Lathrop, James I ^a   Lutz, Jack H ^a   Summers, Scott M ^a  

^a Iowa State University   (United States)

Author keywords

Fractals; Molecular computing; Self assembly; Sierpinski triangles

Indexed keywords

ATOMIC FORCE MICROSCOPY; DNA; MATHEMATICAL MODELS; RECURSIVE FUNCTIONS; SELF ASSEMBLY;

MOLECULAR COMPUTING; SIERPINSKI TRIANGLES;

FRACTAL DIMENSION;

EID: 38149096850     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73001-9_47     Document Type: Conference Paper

References (14)

1. Adleman, L.: Towards a mathematical theory of self-assembly, Tech. report (1999)
2. Adleman, L.M., Cheng, Q., Goel, A., Huang, M.-D. A., Kempe, D., de Espanes, P. M., Rothemund, P. W. K.: Combinatorial optimization problems in self-assembly, pp. 23-32 (2002)
3. Falconer, K.: Fractal geometry: Mathematical foundations and applications, 2nd edn. Wiley, Chichester (2003)
4. Reif, J.H.: Molecular assembly and computation: From theory to experimental demonstrations, International Colloquium on Automata, Languages and Programming, pp. 1-21 (2002)
5. Rothemund, P.W.K.: Theory and experiments in algorithmic self-assembly, Ph.D. thesis, University of Southern California (December 2001)
6. Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). STOC, pp. 459-468 (2000)
7. Rothemund, P.W.K., Papadakis, N., Winfree, E.: Algorithmic self-assembly of DNA Sierpinski triangles, PLoS Biology 2(12) (2004)
8. Seeman, N.C: Nucleic-acid junctions and lattices. Journal of Theoretical Biology 99, 237-247 (1982)
9. Soloveichik, D., Winfree, E.: Complexity of compact proofreading for self-assembled patterns, The Eleventh International Meeting on DNA Computing (2005)
10. Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA Computing. LNCS, vol. 3384, Springer, Heidelberg (2005)
11. Wang, H.: Proving theorems by pattern recognition - II. The Bell System Technical Journal XL(I), 1-41 (1961)
12. Wang, H.: Dominoes and the AEA case of the decision problem. In: Proceedings of the Symposium on Mathematical Theory of Automata (New York, 1962), Polytechnic Press of Polytechnic Inst, of Brooklyn, Brooklyn, N.Y., pp. 23-55 (1963)
13. Willson, S.J.: Growth rates and fractional dimensions in cellular automata. Physica D 10, 69-74 (1984)
14. Winfree, E.: Algorithmic self-assembly of DNA, Ph.D. thesis, California Institute of Technology, June (1998)