DNA-based computation times

Lecture Notes in Computer Science

Volumn 3384, Issue , 2005, Pages 14-23

  Baryshnikov, Yuliy ^a   Coffman, Ed ^b   Momčilović, Petar ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b Columbia University ^*  (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; CELL CULTURE; COMPUTATIONAL METHODS; ENCODING (SYMBOLS); ENERGY UTILIZATION; MICROELECTRONICS; SELF ASSEMBLY;

BOOLEAN FORMULAS; CELL GROWTH; COMPUTING SYSTEMS; MICROELECTRONIC CIRCUITS;

DNA;

EID: 24144467485     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11493785_2     Document Type: Conference Paper

References (20)

1. Wang, H.: Proving theorems by pattern recognition, II. Bell System Technical Journal 40 (1961) 1-42
2. Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology, Pasadena, CA (1998)
3. Rothemund, P., Winfree, E.: The program-size complexity of self-assembled squares. In: Proc. ACM Symp. Th. Comput. (2001) 459-468
4. 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
5. 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) 199-219
6. 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
7. 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 (to appear))
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.: Incremental self-assembly in the fluid limit. In: Proc. 38th Ann. Conf. Inf. Sys. Sci., Princeton, NJ (2004)
10. Carbone, A., Seeman, N.: Circuits and programmable self-assembling DNA structures. Proc. Natl. Acad. Sci. USA 99 (2002) 12577-12582
11. Litvinov, G., Maslov, V.: The correspondence principle for idempotent calculus and some computer applications. In: Idempotency (Bristol, 1994). Volume 11 of Publ. Newton Inst. Cambridge Univ. Press, Cambridge (1998) 420-443
12. Gunawardena, J.: An introduction to idempotency. In: Idempotency (Bristol, 1994). Volume 11 of Publ. Newton Inst. Cambridge Univ. Press, Cambridge (1998) 1-49
13. Liggett, T.: Interacting Particle Systems. Springer-Verlag, New York (1985)
14. Liggett, T.: Stochastic Interacting Systems: Contact, Voter and Exclusion Processes. Springer, Berlin (1999)
15. Arnol'd, V.: Mathematical methods of classical mechanics. Volume 60 of Graduate Texts in Mathematics. Springer-Verlag, New York (1997) Translated from the 1974 Russian original by K. Vogtmann and A. Weinstein, Corrected reprint of the second (1989) edition.
16. Johansson, K.: Shape fluctuations and random matrices. Comm. Math. Phys. 209 (2000) 437-476
17. O'Connell, N.: Random matrices, non-colliding processes and queues. In: Seminaire de Probabilites XXXVI. Volume 1801 of Lecture Notes in Math. Springer, Berlin (2003) 165-182
18. Talagrand, M.: A new look at independence. Ann. Probab. 23 (1996) 1-37
19. Kozlov, S.M.: The method of averaging and walks in inhomogeneous environments. Russ. Math. Surv. 40 (1985) 73-145
20. Translation from Usp. Mat. Nauk 40 (1985) 61-120.