Solving NP-complete problems in the tile assembly model

Theoretical Computer Science

Volumn 395, Issue 1, 2008, Pages 31-46

  Brun, Yuriy ^a  

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

Author keywords

Crystal growth; Distributed computing; Molecular computation; Natural computation; Nondeterministic computation; NP complete; Parallel computing; Self assembly; SubsetSum; Tile assembly model

Indexed keywords

CRYSTAL GROWTH; DISTRIBUTED COMPUTER SYSTEMS; PARALLEL PROCESSING SYSTEMS; PROBABILITY; SELF ASSEMBLY; SET THEORY;

MOLECULAR COMPUTATIONS; NATURAL COMPUTATIONS; NONDETERMINISTIC COMPUTATIONS; TILE ASSEMBLY MODELS;

COMPUTATIONAL COMPLEXITY;

EID: 41149108187     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.07.052     Document Type: Article

References (43)

1. Adleman L. Molecular computation of solutions to combinatorial problems. Science 266 (1994) 1021-1024
2. Leonard Adleman, Towards a mathematical theory of self-assembly, Technical Report 00-722, Department of Computer Science, University of Southern California, Los Angleles, CA, 2000
3. Leonard Adleman, Qi Cheng, Ahish Goel, Ming-Deh Huang, Hal Wasserman, Linear self-assemblies: Equilibria, entropy, and convergence rates, in: Proceedings of the 6th International Conference on Difference Equations and Applications, ICDEA 2001, Augsburg, Germany, June 2001
4. Leonard Adleman, Qi Cheng, Ashish Goel, Ming-Deh Huang, David Kempe, Pablo Moisset de Espanes, Paul Rothermund, Combinatorial optimization problems in self-assembly, in: ACM Symposium on Theory of Computing, STOC02, Montreal, Quebec, Canada, 2002, pp. 23-32
5. Leonard Adleman, Ashish Goel, Ming-Deh Huang, Pablo Moisset de Espanes, Running time and program size for selfassembled squares, in: ACM Symposium on Theory of Computing, STOC02, Montreal, Quebec, Canada, 2001, pp. 740-748
6. Leonard Adleman, Jarkko Kari, Lila Kari, Dustin Reishus, On the decidability of self-assembly of infinite ribbons, in: The 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'02, Ottawa, Ontario, Canada, November 2002, pp. 530-537
7. Aggarwal G., Cheng Q., Goldwasser M.H., Kao M.-Y., de Espanes P.M., and Schweller R.T. Complexities for generalized models of self-assembly. SIAM Journal on Computing 34 6 (2005) 1493-1515
8. Barish R., Rothemund P., and Winfree E. Two computational primitives for algorithmic self-assembly: Copying and counting. Nano Letters 5 12 (2005) 2586-2592
9. Baryshnikov Y., Coffman E.G., and Momcilovic P. DNA-based computation times. Springer Lecture Notes in Computer Science vol. 3384 (2005) 14-23
10. Yuliy Baryshnikov, Ed G. Coffman, Nadrian Seeman, Teddy Yimwadsana, Self correcting self assembly: Growth models and the hammersley process, in: Proceedings of the 11th International Meeting on DNA Computing, DNA 2005, London, Ontario, June 2005
11. Braich R., Chelyapov N., Johnson C., Rothemund P., and Adleman L. Solution of a 20-variable 3-SAT problem on a DNA computer. Science 296 5567 (2002) 499-502
12. Ravinderjit Braich, Cliff Johnson, Paul Rothemund, Darryl Hwang, Nickolas Chelyapov, Leonard Adleman, Solution of a satisfiability problem on a gel-based DNA computer, in: DNA Computing: 6th International Workshop on DNA-Based Computers, DNA2000, Leiden, The Netherlands, June 2000, pp. 27-38
13. Brun Y. Arithmetic computation in the tile assembly model: Addition and multiplication. Theoretical Computer Science 378 June (2007) 17-31
14. Yuriy Brun, Asymptotically optimal program size complexity for solving np-complete problems in the tile assembly model, in: Proceedings of the 13th International Meeting on DNA Computing, DNA07, Memphis, TN, USA, June 2007, 231-240
15. Yuriy Brun, A discreet, fault-tolerant, and scalable software architectural style for internet-sized networks, in: Proceedings of the Doctoral Symposium at the 29th International Conference on Software Engineering, ICSE07, Minneapolis, MN, USA, May 2007, pp. 83-84
16. Yuriy Brun, Discreetly distributing computation via self-assembly, Technical Report USC-CSSE-2007-714, Center for Software Engineering, University of Southern California, 2007
17. Brun Y. Nondeterministic polynomial time factoring in the tile assembly model. Theoretical Computer Science 395 1 (2008) 3-23
18. Yuriy Brun, Manoj Gopalkrishnan, Dustin Reishus, Bilal Shaw, Nickolas Chelyapov, Leonard Adleman, Building blocks for DNA self-assembly, in: Proceedings of the 1st Foundations of Nanoscience: Self-Assembled Architectures and Devices, FNANO'04, Snowbird, UT, April 2004
19. Yuriy Brun, Nenad Medvidovic, An architectural style for solving computationally intensive problems on large networks, in: Proceedings of Software Engineering for Adaptive and Self-Managing Systems, SEAMS07, Minneapolis, MN, USA, May 2007
20. Yuriy Brun, Nenad Medvidovic, Fault and adversary tolerance as an emergent property of distributed systems' software architectures, in: Proceedings of the 2nd International Workshop on Engineering Fault Tolerant Systems, EFTS07, Dubrovnik, Croatia, September 2007
21. Chelyapov N., Brun Y., Gopalkrishnan M., Reishus D., Shaw B., and Adleman L. DNA triangles and self-assembled hexagonal tilings. Journal of American Chemical Society (JACS) 126 43 (2004) 13924-13925
22. Ho-Lin Chen, Ashish Goel, Error free self-assembly with error prone tiles, in: Proceedings of the 10th International Meeting on DNA Based Computers, DNA 2004, Milan, Italy, June 2004
23. Matthew Cook, Paul Rothemund, Erik Winfree, Self-assembled circuit patterns, in: Proceedings of the 9th International Meeting on DNA Based Computers, DNA 2004, Madison, WI, June 2003, pp. 91-107
24. Pablo Moisset de Espanes, Computerized exhaustive search for optimal self-assembly counters, in: The 2nd Annual Foundations of Nanoscience Conference, FNANO'05, Snowbird, UT, April 2005, pp. 24-25
25. Fu T.J., and Seeman N.C. DNA double-crossover molecules. Biochemistry 32 13 (1993) 3211-3220
26. Ming-Yang Kao, Robert 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, FL, January 2006, pp. 571-580
27. Lagoudakis M.G., and LaBean T.H. 2D DNA self-assembly for satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 54 (1999) 141-154
28. John H. Reif, Sadheer Sahu, Peng Yin, Compact error-resilient computational DNA tiling assemblies, in: Proceedings of the 10th International Meeting on DNA Based Computers, DNA 2004, Milan, Italy, June 2004
29. Reishus D., Shaw B., Brun Y., Chelyapov N., and Adleman L. Self-assembly of DNA double-double crossover complexes into high-density, doubly connected, planar structures. Journal of American Chemical Society (JACS) 127 50 (2005) 17590-17591
30. Robinson R.M. Undecidability and nonperiodicity for tilings of the plane. Inventiones Mathematicae 12 3 (1971) 177-209
31. Paul Rothemund, Design of DNA origami, in: Proceedings of the International Conference on Computer-Aided Design, ICCAD 2005, San Jose, CA, November 2005
32. Rothemund P. Folding DNA to create nanoscale shapes and patterns. Nature 440 (2006) 297-302
33. Rothemund P. Scaffolded DNA origami: From generalized multicrossovers to polygonal networks. Nanotechnology: Science and Computation (2006) 3-21
34. Rothemund P., Papadakis N., and Winfree E. Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biology 2 12 (2004) e424
35. Paul W.K. Rothemund, Erik Winfree, The program-size complexity of self-assembled squares, in: Proceedings of the ACM Symposium on Theory of Computing, STOC00, Portland, OR, USA, May 2000, pp. 459-468
36. Sipser M. Introduction to the Theory of Computation (1997), PWS Publishing Company
37. David Soloveichik, Erik Winfree, Complexity of self-assembled shapes, in: Proceedings of the 10th International Meeting on DNA Based Computers, DNA 2004, Milan, Italy, June 2004
38. Wang H. Proving theorems by pattern recognition. I. Bell System Technical Journal 40 (1961) 1-42
39. Winfree E. On the computational power of DNA annealing and ligation. DNA Based Computers (1996) 199-221
40. Erik Winfree, Algorithmic self-assembly of DNA, Ph.D. Thesis, California Insitute of Technology, Pasadena, CA, June 1998
41. Erik Winfree, Simulations of computing by self-assembly of DNA, Technical Report CS-TR:1998:22, California Insitute of Technology, Pasadena, CA, 1998
42. Winfree E. Self-healing tile sets. Nanotechnology: Science and Computation (2006) 55-78
43. Erik Winfree, Renat Bekbolatov, Proofreading tile sets: Error correction for algorithmic self-assembly, in: The 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'02, vol. 2943, Madison, WI, June 2003, pp. 126-144