Randomized self-assembly for approximate shapes

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

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 370-384

  Kao, Ming Yang ^a   Schweller, Robert ^b  

^a Northwestern University   (United States)

^b UNIVERSITY OF TEXAS PAN AMERICAN   (United States)

Author keywords

Approximation Algorithms; Randomized Algorithms; Self Assembly

Indexed keywords

ASSEMBLY; CHLORINE COMPOUNDS; CONCENTRATION (PROCESS); CUSTOMER SATISFACTION; LINGUISTICS; PROBABILITY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; RIVETING; TARGETS; TRANSLATION (LANGUAGES);

APPROXIMATION ALGORITHMS; ASSEMBLED SHAPES; HIGH PROBABILITY; RANDOMIZED ALGORITHMS; RELATIVE CONCENTRATIONS; SELF- ASSEMBLIES; TARGET SHAPE;

SELF ASSEMBLY;

EID: 49049117841     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_31     Document Type: Conference Paper

References (17)

1. Adleman, L., Cheng, Q., Goel, A., Huang, M.: Running time and program size for self-assembled squares. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 740-748 (2001)
2. Adleman, L., Cheng, Q., Goel, A., Huang, M., Kempe, D., Espanes, P., Rothemund, P.: Combinatorial optimization problems in self-assembly. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 23-32 (2002)
3. Aggarwal, G., Cheng, Q., Goldwasser, M.H., Kao, M.-Y., de Espanes, P.M., Schweller, R.T.: Complexities for generalized models of self-assembly. SIAM Journal on Computing 34, 1493-1515 (2005)
4. Aggarwal, G., Goldwasser, M.H., Kao, M.-Y., Schweller, R.T.: Complexities for generalized models of self-assembly. In: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 880-889 (2004)
5. Becker, F., Remila, E., Rapaport, I.: Self-assemblying classes of shapes with a minimum number of tiles, and in optimal time. In: Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (2006)
6. Demaine, E., Demaine, M., Fekete, S., Ishaque, M., Rafalin, E., Schweller, R., Souvaine, D.: Staged self-assembly: Nanomanufacture of arbitrary shapes with O(1) glues. In: Proceedings of the 13th International Meeting on DNA Computing (2007)
7. Fu, T.-J., Seeman, N.C.: DNA double-crossover molecules. Biochemistry 32, 3211-3220 (1993)
8. Kao, M.-Y., Schweller, R.: Reducing tile complexity for self-assembly through temperature programming. In: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithms, pp. 571-580 (2006)
9. LaBean, T.H., Yan, H., Kopatsch, J., Liu, F., Winfree, E., Reif, H.J., Seeman, N.C.: The construction, analysis, ligation and self-assembly of DNA triple crossover complexes. J. Am. Chem. Soc. 122, 1848-1860 (2000)
10. Lagoudakis, M.G., Labean, T.H.: 2D DNA self-assembly for satisfiability. In: Proceedings of the 5th DIMACS Workshop on DNA Based Computers, June 26 1999, pp. 459-468 (1999)
11. Reif, J.: Local parallel biomolecular computation. In: Proceedings of the 3rd Annual DIMACS Workshop on DNA Based Computers, June 23-26 (1997)
12. Rothemund, P., Winfree, E.: The program-size complexity of self-assembled squares. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 459-468 (2000)
13. Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. In: Tenth International Meeting on DNA Computing, pp. 344-354 (2005)
14. Wang, H.: Proving theorems by pattern recognition. Bell System Technical Journal 40, 1-42 (1961)
15. Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology, Pasadena (1998)
16. Winfree, E., Liu, F., Wenzler, L., Seeman, N.: Design and self-assembly of two-dimensional DNA crystals. Nature 394, 539-544 (1998)
17. Winfree, E., Yang, X., Seeman, N.C.: Universal computation via self-assembly of DNA: Some theory and experiments. In: Proceedings of the 2nd International Meeting on DNA Based Computers, June 10-12 1996, pp. 191-213 (1996)