Computability and complexity in self-assembly

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

Volumn 5028 LNCS, Issue , 2008, Pages 349-358

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

^a Iowa State University   (United States)

Author keywords

Computability; Computational complexity; Molecular computing; Self assembly

Indexed keywords

FUNCTION EVALUATION; TWO DIMENSIONAL;

(ALGORITHMIC) COMPLEXITY; (E ,2E) THEORY; ASSEMBLY MODELING; EUCLIDEAN PLANES; NANOSCALE SELF ASSEMBLY; QUADRATIC FUNCTIONS; SELF-ASSEMBLY; TWO-DIMENSIONAL (2D);

SELF ASSEMBLY;

EID: 45849140148     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69407-6_38     Document Type: Conference Paper

References (13)

1. Adleman, L.: Towards a mathematical theory of self-assembly, Tech. report, University of Southern California (2000)
2. Bachrach, J., Beal, J.: Building spatial computers, Tech. report, MIT CSAIL (2007)
3. Beal, J., Sussman, G.: Biologically-inspired robust spatial programming, Tech. report, MIT (2005)
4. Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Transactions of the American Mathematical Society 117, 285-306 (1965)
5. Lathrop, J.I., Lutz, J.H., Summers, S.M.: Strict self-assembly of discrete Sierpinski triangles. In: Proceedings of The Third Conference on Computability in Europe, Siena, Italy, June 18-23, 2007 (2007)
6. Reif, J.H.: Molecular assembly and computation: From theory to experimental demonstrations. In: Proceedings of the Twenty-Ninth International Colloquium on Automata, Languages and Programming, pp. 1-21 (2002)
7. Paul, W.K.: Rothemund, Theory and experiments in algorithmic self-assembly, Ph.D. thesis, University of Southern California (December 2001)
8. Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 459-468 (2000)
9. Seeman, N.C.: Nucleic-acid junctions and lattices. Journal of Theoretical Biology 99, 237-247 (1982)
10. Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. SIAM Journal on Computing 36, 1544-1569 (2007)
11. Wang, H.: Proving theorems by pattern recognition - II. The Bell System Technical Journal XL(1), 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, pp. 23-55 (1963)
13. Winfree, E.: Algorithmic self-assembly of DNA, Ph.D. thesis, California Institute of Technology (June 1998)