Skip to main content

DNA Extraction by XPCR

  • Conference paper
Book cover DNA Computing (DNA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3384))

Included in the following conference series:

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.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adleman, L.M.: Molecular Computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)

    Article  Google Scholar 

  2. 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)

    Chapter  Google Scholar 

  3. 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)

    Article  Google Scholar 

  4. 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)

    Chapter  Google Scholar 

  5. Franco, G., Manca, V.: An algorithmic analysis of DNA structure. Soft Computing (2004) (to appear)

    Google Scholar 

  6. 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)

    MATH  MathSciNet  Google Scholar 

  7. Li, D.: Is DNA computing viable for 3-SAT problems? TCS 290, 2095–2107 (2003)

    Article  MATH  Google Scholar 

  8. Lipton, R.J.: DNA solutions of hard computational problems. Science 268, 542–544 (1995)

    Article  Google Scholar 

  9. Liu, S., Thaler, D.S., Libchaber, A.: Signal and noise in bridging PCR. BMC Biotechnology 2, 13 (2002)

    Article  Google Scholar 

  10. 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)

    Chapter  Google Scholar 

  11. 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)

    Google Scholar 

  12. Rozenberg, G., Spaink, H.: DNA computing by blocking. TCS 292, 653–665 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics