Self-correcting self-assembly: Growth models and the hammersley process

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

Volumn 3892 LNCS, Issue , 2006, Pages 1-11

  Baryshnikov, Yuliy ^a   Coffman, Ed ^b   Seeman, Nadrian ^c   Yimwadsana, Teddy ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b Columbia University ^*  (United States)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GROWTH MODELS; HAMMERSLEY PROCESSES; STOCHASTIC ANALYSIS; TILING MODELS;

COMPUTATIONAL METHODS; DNA; ERROR CORRECTION; GROWTH KINETICS; MATHEMATICAL MODELS; STOCHASTIC CONTROL SYSTEMS;

SELF ASSEMBLY;

EID: 33745753535     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11753681_1     Document Type: Conference Paper

References (22)

1. Baryshnikov, Y., Coffman, E., Momčilović, P.: DNA-based computation times. In: Proc. of the Tenth International Meeting on DNA Computing, Milan, Italy (2004)
2. Adleman, L., Cheng, Q., Goel, A., Huang, M.D.: Running time and program size for self-assembled squares. In: Proc. ACM Symp. Th. Comput. (2001) 740-748
3. Rothemund, P., Winfree, E.: The program-size complexity of self-assembled squares. In: Proc. ACM Symp. Th. Comput. (2001) 459-468
4. Winfree, E.: Complexity of restricted and unrestricted models of molecular computation. In Lipton, R., Baum, E., eds.: DNA Based Computing. Am. Math. Soc., Providence, RI (1996) 187-198
5. Adleman, L., Cheng, Q., Goel, A., Huang, M.D., Kempe, D., de Espanés, P.M., Rothemund, P.: Combinatorial optimization problems in self-assembly. In: Proc. ACM Symp. Th. Comput., Montreal, Canada (2002) 23-32
6. Adleman, L., Cheng, Q., Goel, A., Huang, M.D., Wasserman, H.: Linear self-assemblies: Equilibria, entropy, and convergence rates. In Elaydi, Ladas, Aulbach, eds.: New progress in difference equations, Taylor and Francis, London (2004)
7. Baryshnikov, Y., Coffman, E., Momčilović, P.: Ineremental self-assembly in the fluid limit. In: Proc. 38th Ann. Conf. Inf. Sys. Sci., Princeton, NJ (2004)
8. Baryshnikov, Y., Coffman, E., Winkler, P.: Linear self-assembly and random disjoint edge selection. Technical Report 03-1000, Electrical Engineering Dept., Columbia University (2004)
9. Baryshnikov, Y., Coffman, E., Momčilović, P.: Phase transitions and control in self assembly. In: Proc. Foundations of Nanoscience: Self-Assembled Architectures and Devices, Snowbird, UT (2004)
10. E. G. Coffman, J., Flatto, L., Wright, P.E.: A stochastic checkpoint optimization problem. SIAM J. Comput. 22 (1993) 650-659
11. Wang, H.: Dominoes and AEA case of the decision problem. In: Proc. of the Symposium in the Mathematical Theory of Automata, Polytechnic Press, Brooklyn, NY (1963)
12. Berger, R.: The undecidability of the domino problem. In: Memoirs of the American Mathematical Society. Volume 66. (1966)
13. Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology, Pasadena, CA (1998)
14. Liggett, T.M.: Interacting Particle Systems. Springer-Verlag, New York (1985)
15. Winfree, E., Bekbolatov, R.: Proofreading tile sets: Error correction for algorithmic self-assembly. In: Proceedings of the Ninth International Meeting on DNA Based Computers, Lecture Notes in Computer Science. Volume 2943. (2004) 126-144
16. Chen, H.L., Goel, A.: Error free self-assembly with error prone tiles. In: Proceedings of the Tenth International Meeting on DNA Based Computers, Milan, Italy (2004)
17. Reif, J.H., Sahu, S., Yin, P.: Compact error-resilient computational dna tiling assemblies. In: Proceedings, Tenth International Meeting on DNA Based Computers, Lecture Notes in Computer Science, Springer-Verlag, New York (2004) 293-307
18. Chen, H.L., Cheng, Q., Goel, A., Huang, M.D., de Espanes, P.M.: Invadable self-assembly: Combining robustness with efficiency. In: ACM-SIAM Symposium on Discrete Algorithms. (2004)
19. Fujibayashi, K., Murata, S.: A method of error suppression for self-assembling DNA tiles. In: Proceedings of the Tenth International Meeting on DNA Based Computers: Lecture Notes in Computer Science, Springer Verlag, New York (2004) 284-293
20. Aldous, D., Diaconis, P.: Hammersley's interacting particle process and longest increasing subsequences. Probab. Th. Rel. Fields 103 (1995) 199-213
21. Baryshnikov, Y., Coffman, E., Yimwadsana, T.: Analysis of self-correcting self-assembly growth models. Technical Report 03-1001, Electrical Engineering Dept., Columbia University (2005)
22. Mao, C., Sun, W., Seeman, N.: Designed two-dimensional DNA Holliday Junction Arrays visualized by atomic force microscopy. J. Am. Chem. Soc. 121 (1999) 5437-5443