Arithmetic computation in the tile assembly model: Addition and multiplication

Theoretical Computer Science

Volumn 378, Issue 1, 2007, Pages 17-31

  Brun, Yuriy ^a  

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

Author keywords

Adder; Crystal growth; Molecular computation; Multiplier; Self assembly; Tile assembly model

Indexed keywords

ADDERS; COMPUTATIONAL COMPLEXITY; CRYSTAL GROWTH; LINEAR SYSTEMS; MOLECULAR DYNAMICS; PARALLEL PROCESSING SYSTEMS; SELF ASSEMBLY;

MOLECULAR COMPUTATION; TILE ASSEMBLY MODELS;

COMPUTATIONAL METHODS;

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

References (23)

1. 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
2. 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
3. Adleman L. Molecular computation of solutions to combinatorial problems. Science 266 (1994) 1021-1024
4. Leonard Adleman, Towards a mathematical theory of self-assembly, Technical Report 00-722, Department of Computer Science, University of Southern California, Los Angeles, CA, 2000
5. Leonard Adleman, Ashish Goel, Ming-Deh Huang, Pablo Moisset de Espanes, Running time and program size for self-assembled 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. 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
8. Baryshnikov Y., Coffman E.G., and Momcilovic P. DNA-based Computation Times. Springer Lecture Notes in Computer Science vol. 3384 (2005) 14-23
9. 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
10. 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, p. 27
11. Barish R., Rothemund P., and Winfree E. Two computational primitives for algorithmic self-assembly: Copying and counting. Nano Letters 5 12 (2005) 2586-2592
12. 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
13. 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
14. Fu T.J., and Seeman N.C. DNA double-crossover molecules. Biochemistry 32 13 (1993) 3211-3220
15. 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
16. Robinson R.M. Undecidability and nonperiodicity for tilings of the plane. Inventiones Mathematicae 12 3 (1971) 177-209
17. Rothemund P., Papadakis N., and Winfree E. Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biology 2 12 (2004) e424
18. 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
19. Paul Rothemund, Erik Winfree, The program-size complexity of self-assembled squares, in: ACM Symposium on Theory of Computing, STOC02, Montreal, Quebec, Canada, 2001, pp. 459-468
20. Wang H. Proving theorems by pattern recognition I. Bell System Technical Journal 40 (1961) 1-42
21. 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
22. Erik Winfree, On the computational power of DNA annealing and ligation, in: DNA Based Computers, 1996, pp. 199-221
23. Erik Winfree, Algorithmic self-assembly of DNA, Ph.D. Thesis, Caltech, Pasadena, CA, June 1998