Self-assembly of infinite structures: A survey

Theoretical Computer Science

Volumn 412, Issue 1-2, 2011, Pages 159-165

  Patitz, Matthew J ^a   Summers, Scott M ^b  

^a UNIVERSITY OF TEXAS PAN AMERICAN   (United States)

^b Iowa State University   (United States)

Author keywords

Complexity; Computability; Discrete self similar fractals; Tile self assembly; Turing machines; Undecidability

Indexed keywords

COMPUTABILITY AND DECIDABILITY; SURVEYS; TURING MACHINES;

ASSEMBLY SYSTEMS; COMPLEXITY; COMPUTABILITY; IMPOSSIBILITY RESULTS; SELF-SIMILAR FRACTALS; TILE ASSEMBLY MODELS; UNDECIDABILITY;

SELF ASSEMBLY;

EID: 84865772052     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.08.015     Document Type: Conference Paper

References (35)

1. Leonard Adleman, Towards a mathematical theory of self-assembly, Tech. report, University of Southern California, 2000.
2. Leonard Adleman, Qi Cheng, Ashish Goel, Ming-Deh Huang, Running time and program size for self-assembled squares, in: STOC'01: Proceedings of the thirty-third annual ACM Symposium on Theory of Computing, New York, NY, USA, ACM, 2001, pp. 740-748.
3. Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, David Kempe, Pablo Moisset de Espanés, Paul W.K. Rothemund, Combinatorial optimization problems in self-assembly, in: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, 2002, pp. 23-32.
4. Gagan Aggarwal, Michael H. Goldwasser, Ming-Yang Kao, Robert T. Schweller, Complexities for generalized models of self-assembly, in: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, 2004.
5. Florent Becker, Ivan Rapaport, Eric Rémila, Self-assembling classes of shapes with a minimum number of tiles, and in optimal time, in: Foundations of Software Technology and Theoretical Computer Science, FSTTCS, 2006, pp. 45-56.
6. Nathaniel Bryans, Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki, The power of nondeterminism in self-assembly, Tech. Report 1006.2897, Computing Research Repository, 2010.
7. Ho-Lin Chen, Ashish Goel, Error free self-assembly with error prone tiles, in: Proceedings of the 10th International Meeting on DNA Based Computers, 2004.
8. Qi Cheng, Gagan Aggarwal, Michael H. Goldwasser, Ming-Yang Kao, Robert T. Schweller, Pablo Moisset de Espanés, Complexities for generalized models of self-assembly, SIAM Journal on Computing 34 (2005) 1493-1515.
9. Qi Cheng, Ashish Goel, Pablo Moisset de Espanés, Optimal self-assembly of counters at temperature two, in: Proceedings of the First Conference on Foundations of Nanoscience: Self-assembled Architectures and Devices, 2004.
10. David Doty, Randomized self-assembly for exact shapes, in: Proceedings of the Fiftieth IEEE Conference on Foundations of Computer Science, FOCS, 2009.
11. David Doty, Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe Moser, Zeta-Dimension, in: Proceedings of the Thirtieth International Symposium on Mathematical Foundations of Computer Science, Springer-Verlag, 2005, pp. 283-294.
12. David Doty, Matthew J. Patitz, Scott M. Summers, Limitations of self-assembly at temperature 1, Theoretical Computer Science 412 (2011) 145-158.
13. David Doty, Matthew J. Patitz, Scott M. Summers, Limitations of self-assembly at temperature1, in: Proceedings of The Fifteenth International Meeting on DNA Computing and Molecular Programming, Fayetteville, Arkansas, USA, June 8-11, 2009, in: Lecture Notes in Computer Science, vol. 5877, 2009, pp. 35-44.
14. Ming-Yang Kao, Robert T. Schweller, Reducing tile complexity for self-assembly through temperature programming, in: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, Jan. 2006, 2007, pp. 571-580.
15. Ming-Yang Kao, Robert T. Schweller, Randomized self-assembly for approximate shapes, in: Luca Aceto, Ivan Damgärd, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz (Eds.), International Colloqium on Automata, Languages, and Programming, ICALP, in: Lecture Notes in Computer Science, vol. 5125, Springer, 2008, pp. 370-384.
16. Steven M. Kautz, James I. Lathrop, Self-assembly of the Sierpinski carpet and related fractals, in: Proceedings of The Fifteenth International Meeting on DNA Computing and Molecular Programming, Fayetteville, Arkansas, USA, June 8-11, 2009, in: Lecture Notes in Computer Science, vol. 5877, 2009, pp. 78-87.
17. James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, Computability and complexity in self-assembly, Theory of Computing Systems (in press).
18. James I. Lathrop, Jack H. Lutz, Scott M. Summers, Strict self-assembly of discrete Sierpinski triangles, Theoretical Computer Science 410 (2009) 384-405.
19. Jack H. Lutz, Brad Shutters, Approximate self-assembly of the Sierpinski triangle, in: Proceedings of The Sixth Conference on Computability in Europe, Ponta Delgada, Portugal, June 30-July 4, 2010, in: LNCS, vol. 6158, Springer, 2010, pp. 286-295.
20. Urmi Majumder, Thomas H. LaBean, John H. Reif, Activatable tiles for compact error-resilient directional assembly, in: 13th International Meeting on DNA Computing (DNA 13), Memphis, Tennessee, June 4-8, 2007, 2007.
21. Matthew J. Patitz, Scott M. Summers, Self-assembly of decidable sets, Natural Computing (in press).
22. Matthew J. Patitz, Scott M. Summers, Self-assembly of discrete self-similar fractals, Natural Computing 9 (1) (2010) 135-172.
23. John H. Reif, Molecular assembly and computation: From theory to experimental demonstrations, in: Proceedings of the Twenty-Ninth International Colloquium on Automata, Languages and Programming, 2002, pp. 1-21.
24. Paul W.K. Rothemund, Theory and experiments in algorithmic self-assembly, Ph.D. thesis, University of Southern California, December 2001.
25. Paul W. K. Rothemund, Erik Winfree, The program-size complexity of self-assembled squares (extended abstract), in: STOC'00: Proceedings of the thirty-second annual ACM Symposium on Theory of Computing, ACM, New York, NY, USA, 2000, pp. 459-468.
26. Paul W.K. Rothemund, Nick Papadakis, Erik Winfree, Algorithmic self-assembly of DNA Sierpinski triangles, PLoS Biology 2 (12) (2004) 2041-2053.
27. Nadrian C. Seeman, Nucleic-acid junctions and lattices, Journal of Theoretical Biology 99 (1982) 237-247.
28. David Soloveichik, Erik Winfree, Complexity of compact proofreading for self-assembled patterns, in: The eleventh International Meeting on DNA Computing, 2005.
29. David Soloveichik, Erik Winfree, Complexity of self-assembled shapes, SIAM Journal on Computing 36 (6) (2007) 1544-1569.
30. Thomas LaBean, Urmi Majumder, Sudheer Sahu, John H. Reif, Design and simulation of self-repairing DNA lattices, in: DNA Computing: DNA12, in: Lecture Notes in Computer Science, vol. 4287, Springer-Verlag, 2006.
31. Hao Wang, Proving theorems by pattern recognition - II, The Bell System Technical Journal XL (1) (1961) 1-41.
32. Hao Wang, 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, NY, 1963, pp. 23-55.
33. Erik Winfree, Algorithmic self-assembly of DNA, Ph.D. thesis, California Institute of Technology, June 1998.
34. Erik Winfree, Simulations of computing by self-assembly, Tech. Report CaltechCSTR:1998.22, California Institute of Technology, 1998.
35. Erik Winfree, Renat Bekbolatov, Proofreading tile sets: Error correction for algorithmic self-assembly, in: Junghuei Chen, John H. Reif (Eds.), DNA, in: Lecture Notes in Computer Science, vol. 2943, Springer, 2003, pp. 126-144.