Complexity of compact proofreading for self-assembled patterns

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

Volumn 3892 LNCS, Issue , 2006, Pages 305-324

  Soloveichik, David ^a   Winfree, Erik ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOCHEMICAL COMPUTATION; FAULT-TOLERANCE; PROOFREADING TRANSFORMATIONS; SELF-ASSEMBLED PATTERNS;

ALGORITHMS; ERROR CORRECTION; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; MEDICAL COMPUTING; SELF ASSEMBLY;

COMPUTATIONAL COMPLEXITY;

EID: 33745758220     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11753681_24     Document Type: Conference Paper

References (26)

1. L. M. Adleman, Q. Cheng, A. Goel, and M.-D. A. Huang. Running time and program size for self-assembled squares. In ACM Symposium on Theory of Computing (STOC), pages 740-748, 2001.
2. G. Aggarwal, M. Goldwasser, M. Kao, and R. T. Schweller. Complexities for generalized models of self-assembly. In Symposium on Discrete Algorithms (SODA), pages 880-889, 2004.
3. R. D. Barish, P. W. K. Rothemund, and E. Winfree. Two computational primitives for algorithmic self-assembly: Copying and counting. NanoLetters, to appear.
4. H.-L. Chen and A. Goel. Error free self-assembly using error prone tiles. In Ferretti et al. [7], pages 62-75.
5. J. Chen and J. Reif, editors. DNA Computing 9, volume LNCS 2943, Berlin Heidelberg, 2004. Springer-Verlag.
6. M. Cook, P. W. K. Rothemund, and E. Winfree. Self-assembled circuit patterns. In Chen and Reif [5], pages 91-107.
7. C. Ferretti, G. Mauri, and C. Zandron, editors. DNA Computing 10, volume LNCS 3384, Berlin Heidelberg, 2005. Springer-Verlag.
8. P. W. K. Rothemund. Theory and Experiments in Algorithmic Self-Assembly. PhD thesis, University of Southern California, Los Angeles, 2001.
9. P. W. K. Rothemund, N. Papakakis, and E. Winfree. Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biology, 2:e424, 2004.
10. P. W. K. Rothemund and E. Winfree. The program-size complexity of self-assembled squares. In ACM Symposium on Theory of Computing (STOC), pages 459-468, 2000.
11. L. Hurd, J. Kari, and K. Culik. The topological entropy of cellular automata is uncomputable. Ergodic Theory Dynamical Systems, 12:255-265, 1992.
12. T. H. LaBean, H. Yan, J. Kopatsch, F. Liu, E. Winfree, J. H. Reif, and N. C. Seeman. Construction, analysis, ligation, and self-assembly of DNA triple crossover complexes. Journal of the Americal Chemical Society, 122:1848-1860, 2000.
13. M. G. Lagoudakis and T. H. LaBean. 2-D DNA self-assembly for satisfiability. In E. Winfree and D. K. Gifford, editors, DNA Based Computers V, volume 54 of DIMACS, pages 141-154, Providence, RI, 2000. American Mathematical Society.
14. C. Mao, T. H. LaBean, J. H. Reif, and N. C. Seeman. Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature, 407:493-496, 2000.
15. C. Mao, W. Sun, and N. C. Seeman. Designed two-dimensional DNA holliday junction arrays visualized by atomic force microscopy. Journal of the Americal Chemical Society, 121:5437-5443, 1999.
16. J. Reif. Local parallel biomolecular computing. In H. Rubin and D. H. Wood, editors, DNA Based Computers III, volume 48 of DIMACS, pages 217-254, Providence, RI, 1999. American Mathematical Society.
17. J. H. Reif, S. Sahu, and P. Yin. Compact error-resilient computational DNA tiling assemblies. In Ferretti et al. [7], pages 293-307.
18. R. Schulman and E. Winfree. Programmable control of nucleation for algorithmic self-assembly. In Ferretti et al. [7], pages 319-328.
19. R. Schulman and E. Winfree. Self-replication and evolution of DNA crystals. In M. S. Capcarrere, A. A. Freitas, P. J. Bentley, C. G. Johnson, and J. Timmis, editors, Advances in Artificial Life: 8th European Conference (ECAL), volume LNCS 3630, pages 734-743. Springer-Verlag, 2005.
20. D. Soloveichik and E. Winfree. Complexity of self-assembled shapes, 2005. Extended abstract; preprint of the full paper is cs.CC/0412096 on arXiv.org.
21. E. Winfree. On the computational power of DNA annealing and ligation. In R. J. Lipton and E. B. Baum, editors, DNA Based Computers, volume 27 of DIMACS, pages 199-221, Providence, RI, 1996. American Mathematical Society.
22. E. Winfree. Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology, Pasadena, 1998.
23. E. Winfree. Simulations of computing by self-assembly. Technical Report CS-TR: 1998.22, Caltech, 1998.
24. E. Winfree and R. Bekbolatov. Proofreading tile sets: Error-correction for algorithmic self-assembly. In Chen and Reif [5], pages 126-144.
25. 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.
26. E. Winfree, X. Yang, and N. C. Seeman. Universal computation via self-assembly of DNA: Some theory and experiments. In L. F. Landweber and E. B. Baum, editors, DNA Based Computers II, volume 44 of DIMACS, pages 191-213, Providence, RI, 1998. American Mathematical Society.