Two lower bounds for self-assemblies at temperature 1

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2009, Pages 808-809

  Maňuch, Ján ^a   Stacho, Ladislav ^a   Stoll, Christine ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AMORPHOUS COMPUTING; ASSEMBLY MODEL; AUTONOMOUS PROCESS; BINDING DOMAIN; CIRCUIT FABRICATION; COMB-LIKE; COMPLEX OBJECTS; DNA MOLECULES; DNA-COMPUTING; EXPRESSIBILITY; GROWING PROCESS; INFINITE SUPPLY; KOLMOGOROV COMPLEXITY; LOWER BOUNDS; SELF-ASSEMBLING;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; CONTROL THEORY; DNA; GENES; GENETIC PROGRAMMING; GLUES; GLUING; MOLECULES; NANOROBOTICS; NUCLEIC ACIDS; SELF ASSEMBLY;

BUILDING MATERIALS;

EID: 72949091441     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1529282.1529453     Document Type: Conference Paper

References (7)

1. L. Adleman, Q. Cheng, A. Goel, M.-D. Huang, D. Kempe, P. de Espanes, and P. Rothemund. Combinatorial optimization problems in self-assembly. In Proceedings of STOC, pages 23-32, 2002.
2. M. Gomez-Lopez, J. Preece, and J. Stoddart. The art and science of self-assembling molecular machines. Nanotechnology, 7:183-192, 1996.
3. T. LaBean, H. Yan, J. Kopatsch, F. Liu, E. Winfree, J. Reif, and N. Seeman. Construction, analysis, ligation, and self-assembly of DNA triple crossover complexes. Journal of the American Chemical Society, 122:1848-1860, 2000.
4. P. Rothemund, N. Papadakis, and E. Winfree. Algorithmic self-assembly of DNA sierpinski triangles. PLoS Biology, 2:2041-2053, 2004.
5. P. Rothemund and E. Winfree. The program-size complexity of self-assembled squares. In Proceedings of STOC, pages 459-468, 2000.
6. D. Soloveichik and E. Winfree. Complexity of self-assembled shapes. SIAM Journal on Computing, 36:1544-1569, 2007.
7. G. Whitesides, J. Mathias, and C. Seto. Molecular self-assembly and nanochemistry: a chemical strategy for the synthesis of nanostructures. Science, 254:1312-1319, 1991.