Abstract
Speed of computation and power consumption are the two main parameters of conventional computing devices implemented in microelectronic circuits. As performance of such devices approaches physical limits, new computing paradigms are emerging. Two paradigms receiving great attention are quantum and DNA-based molecular computing.
This paper focuses on DNA-based computing. This paradigm can be abstracted to growth models where computational elements called tiles are self-assembled one by one, subject to some simple hierarchical rules, to fill a given template encoding a Boolean formula. While DNA-based computational devices are known to be extremely energy efficient, little is known concerning the fundamental question of computation times. In particular, given a function, we study the time required to determine its value for a given input. In the simplest instance, the analysis has interesting connections with interacting particle systems and variational problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wang, H.: Proving theorems by pattern recognition, II. Bell System Technical Journal 40, 1–42 (1961)
Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology, Pasadena, CA (1998)
Rothemund, P., Winfree, E.: The program-size complexity of self-assembled squares. In: Proc. ACM Symp. Th. Comput., pp. 459–468 (2001)
Adleman, L., Cheng, Q., Goel, A., Huang, M.D.: Running time and program size for self-assembled squares. In: Proc. ACM Symp. Th. Comput., pp. 740–748 (2001)
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, pp. 199–219 (1996)
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, pp. 23–32 (2002)
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)
Baryshnikov, Y., Coffman, E., Winkler, P.: Linear self-assembly and random disjoint edge selection. Technical Report 03-1000, Electrical Engineering Dept., Columbia University (2004)
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)
Carbone, A., Seeman, N.: Circuits and programmable self-assembling DNA structures. In: Proc. Natl. Acad. Sci., USA, vol. 99, pp. 12577–12582 (2002)
Litvinov, G., Maslov, V.: The correspondence principle for idempotent calculus and some computer applications. In: Idempotency (Bristol, 1994). Publ. Newton Inst., vol. 11, pp. 420–443. Cambridge Univ. Press, Cambridge (1998)
Gunawardena, J.: An introduction to idempotency. In: Idempotency (Bristol, 1994). Publ. Newton Inst., vol. 11, pp. 1–49. Cambridge Univ. Press, Cambridge (1998)
Liggett, T.: Interacting Particle Systems. Springer, New York (1985)
Liggett, T.: Stochastic Interacting Systems: Contact, Voter and Exclusion Processes. Springer, Berlin (1999)
Arnol′d, V.: Mathematical methods of classical mechanics. Graduate Texts in Mathematics, vol. 60. Springer, New York (1997); Translated from the 1974 Russian original by K. Vogtmann, A. Weinstein, Corrected reprint of the second edition (1989)
Johansson, K.: Shape fluctuations and random matrices. Comm. Math. Phys. 209, 437–476 (2000)
O’Connell, N.: Random matrices, non-colliding processes and queues. In: Seminaire de Probabilites XXXVI. Lecture Notes in Math., vol. 1801, pp. 165–182. Springer, Berlin (2003)
Talagrand, M.: A new look at independence. Ann. Probab. 23, 1–37 (1996)
Kozlov, S.M.: The method of averaging and walks in inhomogeneous environments. Russ. Math. Surv. 40, 73–145 (1985); Translation from Usp. Mat. Nauk. 40, 61–120 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baryshnikov, Y., Coffman, E., Momčilović, P. (2005). DNA-Based Computation Times. In: Ferretti, C., Mauri, G., Zandron, C. (eds) DNA Computing. DNA 2004. Lecture Notes in Computer Science, vol 3384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493785_2
Download citation
DOI: https://doi.org/10.1007/11493785_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26174-2
Online ISBN: 978-3-540-31844-6
eBook Packages: Computer ScienceComputer Science (R0)