Toward minimum size self-assembled counters

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

Volumn 4848 LNCS, Issue , 2008, Pages 46-53

  Goel, Ashish ^a   De Espanés, Pablo Moisset ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSEMBLY MODELING; DNA COMPUTING; DNA SELF-ASSEMBLY; MINIMUM SIZE; SELF-ASSEMBLED;

CALCULATIONS; DNA; GENES; GENETIC PROGRAMMING; ORGANIC ACIDS; SELF ASSEMBLY; TECHNOLOGY;

NUCLEIC ACIDS;

EID: 49949088536     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77962-9_5     Document Type: Conference Paper

References (20)

1. Adleman, L., Cheng, Q., Goel, A., Huang, M.: Running time and program size for self-assembled squares. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 740-748. ACM Press, New York (2001)
2. Aggarwal, G., Goldwasser, M., Kao, M., Schweller, R.T.: Complexities for generalized models of self-assembly. In: Proceedings of symposium on discrete algorithms, ACM Press, New York (2004)
3. Cheng, Q., Moisset de Espanés, P.: Resolving two open problems in the self-assembly of squares. Technical Report 03-793, University of Southern California (2003)
4. Moisset de Espanés, P., Goel, A.: Toward minimum size self-assembled counters. In: 13th, International Meeting on DNA Computing (2007)
5. Moisset de Espanés, P.: Computerized exhaustive search for optimal self-assembly counters. In: FNANO 2005: Proceedings of the 2nd Annual Foundations of Nanoscience Conference, pp. 24-25 (2005)
6. Moisset de Espanés, P.: Systems self-assembly: Multidisciplinary snapshots, N. Krasnogor, S. Gustafson, D. Pelta, J.L. Verdegay (eds.) Elsevier (2007)
7. Goel, A., Chen, H., Cheng, Q., Moisset de Espanes, P.: Invadable self-assembly, combining robustness with efficiency. In: Proceedings of symposium, on discrete algorithms, ACM Press, New York (2004)
8. Kao, M.-Y., Schweller, R.: Reducing tile complexity for self-assembly through temperature programming (2006)
9. Rothemund, P., Cook, M., Winfree, E.: Self assembled circuit patterns. In: Proceedings of DNA Computing, Springer, Heidelberg (2003)
10. Goel, A., Cheng, Q., Moisset de Espanés, P.: Optimal self-assembly of counters at temperature two. In: Foundation of Nanoscience (2004)
11. Rothemund, P.: Theory and Experiments in Algorithmic Self-Assembly. PhD thesis, University of Southern California (200,1)
12. Rothemund, P.W., Papadakis, N., Winfree, E.: Algorithmic self-assembly of dna sierpinski triangles. PLoS Biol. 2(12) (December 2004)
13. Rothemund, P.W.K.: Design of dna origami. In: ICCAD 2005: Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, pp. 471-478. IEEE Computer Society, Washington (2005)
14. 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. ACM Press, New York, (2000)
15. Wang, H.: Proving theorems by pattern recognition ii. Bell Systems Technical Journal 40, 1-42 (1961)
16. Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology, Pasadena(1998)
17. Winfree, E., Liu, F., Wenzler, L., Seeman, N.: Design and self-assembly of two-dimensional dna crystals (6 pages). Nature 394, 539-544 (1998)
18. Winfree, E., Yang, X., Seeman, N.: Universal computation via self-assembly of dna: Some theory and experiments. In: Proceedings of the Second Annual Meeting on DNA Based Computers, Princeton University (June 1996)
19. Winfree, E., Bekbolatov, R.: Proofreading tile sets: Errror correction for algorithmic self-assembly. In: DNA, pp. 126-144 (2003)
20. Yurke, B., Turberfield, A., Mills Jr, A., Simmel, F., Neumann, J.: A dna-fuelled molecular machine made of DNA. Nature 406, 605-608 (2000)