Complexities for generalized models of self-assembly

SIAM Journal on Computing

Volumn 34, Issue 6, 2005, Pages 1493-1515

  Aggarwal, Gagan ^a   Cheng, Q I ^b   Goldwasser, Michael H ^c   Kao, Ming Yang ^d   De Espanes, Pablo Moisset ^e   Schweller, Robert T ^d  

^a Stanford University   (United States)

^b UNIVERSITY OF OKLAHOMA   (United States)

^c SAINT LOUIS UNIVERSITY   (United States)

^d Northwestern University   (United States)

^e University of Southern California ^*  (United States)

Author keywords

Kolmogorov complexity; Polyominoes; Self assembly; Tile complexity; Tilings; Wang tiles

Indexed keywords

KOLMOGOROV COMPLEXITY; POLYOMINOES; SELF-ASSEMBLY; TILE COMPLEXITY; TILINGS; WANG TILES;

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS;

SELF ASSEMBLY;

EID: 29344465994     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704445202     Document Type: Article

References (13)

1. L. ADLEMAN, Q. CHENG, A. GOEL, AND M. HUANG, Running time and program size for self-assembled squares, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Heraklion, Greece, 2001, ACM, New York, pp. 740-748.
2. L. ADLEMAN, Q. CHENG, A. GOEL, M. HUANG, D. KEMPE, P. ESPANES, AND P. ROTHEMUND, Combinatorial optimization problems in self-assembly, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montreal, Canada, 2002, ACM, New York, pp. 23-32.
3. Q. CHENG AND P. M. DE ESPANES, Resolving Two Open Problems in the Self-Assembly of Squares, Technical Report 793, University of Southern California, Los Angeles, CA, 2003.
4. T.-J. FU AND N. C. SEEMAN, DNA double-crossover molecules, Biochem., 32 (1993), pp. 3211-3220.
5. T. H. LABEAN, H. YAN, J. KOPATSCH, F. LIU, E. WINFREE, H. J. REIF, AND N. C. SEEMAN, The construction, analysis, ligation, and self-assembly of DNA triple crossover complexes, J. Amer. Chem. Soc., 122 (2000), pp. 1848-1860.
6. M. G. LAGOUDAKIS AND T. H. LABEAN, 2D DNA self-assembly for satisfiability, in Proceedings of the 5th DIMACS Workshop on DNA Based Computers, Cambridge, MA, 1999, AMS, Providence, RI, pp. 459-468.
7. M. LI AND P. VITANYI, An Introduction to Kolmogorov Complexity and Its Applications, 2nd ed., Springer Verlag, New York, 1997.
8. J. H. REIF, Local parallel biomolecular computation, in Proceedings of the 3rd Annual DIMACS Workshop on DNA Based Computers, Philadelphia, PA, 1997, H. Rubin and D. H. Wood, eds., DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 48, AMS, Providence, RI, 1999, pp. 217-254.
9. P. ROTHEMUND AND E. WINFREE, The program-size complexity of self-assembled squares, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, 2000, ACM, New York, pp. 459-468.
10. H. WANG, Proving theorems by pattern recognition, Bell Systems Tech. J., 40 (1961), pp. 1-42.
11. E. WINFREE, Algorithmic Self-Assembly of DNA, Ph.D. thesis, California Institute of Technology, Pasadena, CA, 1998.
12. E. WINFREE, F. LIU, L. WENZLER, AND N. SEEMAN, Design and self-assembly of two-dimensional DNA crystals, Nature, 394 (1998), pp. 539-544.
13. E. WINFREE, X. YANG, AND N. C. SEEMAN, Universal computation via self-assembly of DNA: Some theory and experiments, in DNA Based Computers II, L. F. Landweber and E. B. Baum, eds., DIMACS 44, AMS, Providence, RI, 1996, pp. 191-213.