Abstract
A DNA algorithm based on polymerase extension and cutting operations is proposed to solve an instance of SAT with significant dimension. It suggests a combination of efficient DNA operations following the schema of the extract model. Its generating step is performed by a variant of a recently introduced technique called XPCR, while the extraction of the solutions is implemented by a combination of polymerase extension and restriction endonuclease action.
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
Adleman, L.M.: Molecular Computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)
Braich, R.S., Chelyapov, N., Johnson, C., Rothemund, P.W.K., Adleman, L.M.: Solution of a 20-variable 3-SAT problem on a DNA computer. Science 296, 499–502 (2002)
Faulhammer, D., Cukras, A.R., Lipton, R.J., Landweber, L.F.: Molecular computation: RNA solution to chess problems. Proc. Natl. Acad. Sci. USA 98, 1385–1389 (2000)
Franco, G., Giagulli, C., Laudanna, C., Manca, V.: DNA Extraction by XPCR. In: Ferretti, C., Mauri, G., Zandron, C., et al. (eds.) DNA 2004. LNCS, vol. 3384, pp. 104–112. Springer, Heidelberg (2005)
Franco, G., Manca, V., Giagulli, C., Laudanna, C.: DNA Recombination by XPCR. In: Proceedings of DNA11, London, Ontario (June 2005) (to appear)
Freund, R., Kari, L., Păun, G.: DNA Computing Based on Splicing: The Existence of Universal Computers. Theory of Computing Systems 32(1), 69–112 (1999)
Head, T.: Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors. Bulletin of Mathematical Biology 49, 737–759 (1987)
Li, D.: Is DNA computing viable for 3-SAT problems? TCS 290, 2095–2107 (2003)
Lipton, R.J.: DNA solutions of hard computational problems. Science 268, 542–544 (1995)
Jonoska, N., Mahalingam, K.: Languages of DNA based code words. In: Chen, J., Reif, J.H. (eds.) DNA 2003. LNCS, vol. 2943, pp. 61–73. Springer, Heidelberg (2004)
Kirkpatrick, S., Selman, B.: Critical behaviour in the satisfiability of random Boolean expressions. Science 264, 1297–1301 (1994)
Manca, V.: A Proof of Regularity for Finite Splicing. In: Jonoska, N., Păun, G., Rozenberg, G. (eds.) Aspects of Molecular Computing. LNCS, vol. 2950, pp. 309–317. Springer, Heidelberg (2003)
Sakamoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., Hagiya, M.: Molecular Computation by DNA Hairpin Formation. Science 288, 1223–1226 (2000)
Selman, B., Mitchell David, G., Levesque Hector, J.: Generating hard satisfiability problems. Artificial Intelligence 81, 17–29 (1996)
van Noort, D., Gast, F., McCaskill, J.S.: DNA computing in microreactors. In: Jonoska, N., Seeman, N.C. (eds.) DNA 2001. LNCS, vol. 2340, pp. 44–53. Springer, Heidelberg (2002)
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
Franco, G. (2005). A Polymerase Based Algorithm for SAT. In: Coppo, M., Lodi, E., Pinna, G.M. (eds) Theoretical Computer Science. ICTCS 2005. Lecture Notes in Computer Science, vol 3701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560586_20
Download citation
DOI: https://doi.org/10.1007/11560586_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29106-0
Online ISBN: 978-3-540-32024-1
eBook Packages: Computer ScienceComputer Science (R0)