Abstract
The extraction of DNA strands including a given sequence of bases is a crucial step in the Adleman-Lipton extract model of DNA computing. In this paper, a special type of PCR is presented with a related algorithm which performs a specified extraction from a given pool of DNA double stranded (shortly dsDNA) molecules. This kind of PCR, called Cross Pairing PCR (shortly XPCR) was tested in several situations, and used in a biotechnological procedure which implements the extraction algorithm.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adleman, L.M.: Molecular Computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)
Arita, M.: Writing Information into DNA. In: Jonoska, N., Păun, G., Rozenberg, G. (eds.) Aspects of Molecular Computing. LNCS, vol. 2950, pp. 23–35. Springer, Heidelberg (2003)
Braich, R.S., Chelyapov, N., Johnson, C., Rothemund, P.W.K., Adleman, L.: Solution of a 20-Variable 3-SAT Problem on a DNA Computer. Science 296, 417–604 (2002)
Braich, R.S., Johnson, C., Rothemund, P.W.K., Hwang, D., Chelyapov, N., Adleman, L.: Solution of a Satisfiability Problem on a Gel-Based DNA Computer. In: Condon, A., Rozenberg, G. (eds.) DNA 2000. LNCS, vol. 2054, pp. 27–42. Springer, Heidelberg (2001)
Franco, G., Manca, V.: An algorithmic analysis of DNA structure. Soft Computing (2004) (to appear)
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)
Liu, S., Thaler, D.S., Libchaber, A.: Signal and noise in bridging PCR. BMC Biotechnology 2, 13 (2002)
Manca, V., Zandron, C.: A Clause String DNA Algorithm for SAT. In: Jonoska, N., Seeman, N.C. (eds.) DNA 2001. LNCS, vol. 2340, pp. 172–181. Springer, Heidelberg (2002)
Manca, V.: On the logic of DNA bilinearity Preliminary Proceedings. In: Hagiya, M., Ohuchi, A. (eds.) DNA Computing, 8th International Meeting on DNA Based Computers, Hokkaido, Japan, p. 330 (2002)
Rozenberg, G., Spaink, H.: DNA computing by blocking. TCS 292, 653–665 (2003)
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., Giagulli, C., Laudanna, C., Manca, V. (2005). DNA Extraction by XPCR. 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_9
Download citation
DOI: https://doi.org/10.1007/11493785_9
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)