Skip to main content
SpringerLink
Log in

Algorithmic applications of XPCR

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

An emerging trend in DNA computing consists of the algorithmic analysis of new molecular biology technologies, and in general of more effective tools to tackle computational biology problems. An algorithmic understanding of the interaction between DNA molecules becomes the focus of some research which was initially addressed to solve mathematical problems by processing data within biomolecules. In this paper a novel mechanism of DNA recombination is discussed, that turned out to be a good implementation key to develop new procedures for DNA manipulation (Franco et al., DNA extraction by cross pairing PCR, 2005; Franco et al., DNA recombination by XPCR, 2006; Manca and Franco, Math Biosci 211:282–298, 2008). It is called XPCR as it is a variant of the polymerase chain reaction (PCR), which was a revolution in molecular biology as a technique for cyclic amplification of DNA segments. A few DNA algorithms are proposed, that were experimentally proven in different contexts, such as, mutagenesis (Franco, Biomolecular computing—combinatorial algorithms and laboratory experiments, 2006), multiple concatenation, gene driven DNA extraction (Franco et al., DNA extraction by cross pairing PCR, 2005), and generation of DNA libraries (Franco et al., DNA recombination by XPCR, 2006), and some related ongoing work is outlined.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Adleman LM (1994) Molecular computation of solutions to combinatorial problems. Science 266:1021–1024

    Article  Google Scholar 

  • Arrighi P (2003) Quantum computation explained to my mother. Bull EATCS 80:134–142

    MathSciNet  MATH  Google Scholar 

  • Braich RS, Chelyapov N, Johnson C, Rothemund PWK, Adleman L (2002) Solution of a 20-variable 3-SAT problem on a DNA computer. Science 296:499–502

    Article  Google Scholar 

  • Chen JH, Seeman NC (1991) Synthesis from DNA of a molecule with the connectivity of a cube. Nature 350:631–633

    Article  Google Scholar 

  • Conrad M (1985) On design principles for a molecular computer. Commun ACM 28:464–480

    Article  Google Scholar 

  • Ehrenfeucht A, Hoogeboom HJ, Rozenberg G, van Vugt N (2000) Forbidding and enforcing. In: Winfree E et al (eds) DNA based computers V, DIMACS Series AMS, vol 54. pp 195–206

  • Ehrenfeucht A, Prescott DM, Rozenberg G (2001) Computational aspects of gene (un)scrambling in ciliates. In: Landweber LF et al. (eds) Evolution as computation. Springer, Berlin, pp 216–256

    Google Scholar 

  • Franco G (2005) A polymerase based algorithm for SAT. In: Coppo M et al (eds) Proceedings ICTCS 2005, LNCS 3701. Springer-Verlag, pp 237–250

  • Franco G (2006) Biomolecular computing—combinatorial algorithms and laboratory experiments. PhD Thesis, University of Verona, Italy

  • Franco G, Giagulli C, Laudanna C, Manca V (2005) DNA extraction by cross pairing PCR. In: Ferretti C et al. (eds) Revised selected papers from DNA 10, LNCS 3384. Springer-Verlag, pp 106–114

  • Franco G, Jonoska N (2005) Forbidding—enforcing conditions in DNA self-assembly. In: Chen J, Jonoska N et al. (eds) Nanotechnology, science and computation, pp 105–118

  • Franco G, Manca V (2005) An algorithmic analysis of DNA structure. Soft Comput 9(10):761–768

    Article  MATH  Google Scholar 

  • Franco G, Manca V, Giagulli C, Laudanna C (2006) DNA recombination by XPCR. In: Carbone A et al (eds) Revised Selected Papers from DNA 11, LNCS 3892. Springer-Verlag, pp 55–66

  • Franco G, Margenstern M (2008) A DNA computing inspired computational model. TCS 404:88–96

    Article  MathSciNet  MATH  Google Scholar 

  • Gal S, Monteith N, Macula AJ (2008) Successful preparation and analysis of a 5-site 2-variable DNA library. Nat Comput 8(2):333–347

    Article  MathSciNet  Google Scholar 

  • Goel A, Simmel FC, Sosik P (eds) (2008) In: Preliminary proceedings of the 14th international meeting on DNA computing, Prague, Czech Republic

  • Gong Z, Zhang H, Gabos S, Li XF (2004) Rapid and efficient polymerase chain reaction-based strategies for one-site and two-site mutagenesis. Anal Biochem 331:404–406

    Article  Google Scholar 

  • Head T (1987) Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull Math Biol 49:737–759

    MathSciNet  MATH  Google Scholar 

  • Hussini S, Kari L, Konstantinidis S (2002) Coding properties of DNA languages. In: Jonoska N et al (eds) Revised selected papers from DNA 7, LNCS 2340, Springer-Verlag. pp 57–69

  • Jonoska N, Sa-Ardyen P, Seeman NC (2003) Computation by self-assembly of DNA graphs. J Genet Progr Evolvable Mach 4(2):123–137

    Article  Google Scholar 

  • Kari L, Rozenberg G (2008) The many facets of natural computing. Commun ACM 51(10): 72–83

    Article  Google Scholar 

  • Lee JY, Lim HW, Yoo S-I, Zhang BT, Park TH (2005) Efficient initial pool generation for weighted graph problems using parallel overlap assembly. In: Ferretti C et al (eds) Revised selected papers from DNA 10, LNCS 3384. Springer-Verlag, pp 215–223

  • Lipton RJ (1995) DNA solutions of hard computational problems. Science 268:542–544

    Article  Google Scholar 

  • Manca V (2005) On the logic and geometry of bilinear forms. Fundamenta Informaticae 64:261–273

    MathSciNet  MATH  Google Scholar 

  • Manca V (2002) On the logic of DNA bilinearity. In: Hagiya M et al (eds) Preliminary proceedings of DNA 8, pp 330

  • Manca V, Franco G (2008) Computing by polymerase chain reaction. Math Biosci 211:282–298

    Article  MathSciNet  MATH  Google Scholar 

  • Manca V, Franco G, Lampis S, Vallini G (2008) The phenomenon of sampling and growing in bio-populations. In: Extended abstract in proceedings of the 14th international meeting on DNA computing, Prague, Czech Republic

  • Manca V, Zandron C (2002) A clause string DNA algorithm for SAT. In: Jonoska N et al (eds) Revised selected papers from DNA 7, LNCS 2340. Springer-Verlag, pp 172–181

  • Mao C, Sun W, Seeman NC (1999) Designed two-dimensional holliday junction arrays visualized by atomic force microscopy. J Am Chem Soc 121:5437–5443

    Article  Google Scholar 

  • Kari L, Thierrin G (1996) Contextual insertions/deletions and computability. Inf Comput 131(1):47–61

    Article  MathSciNet  MATH  Google Scholar 

  • Pachuk CJ, Samuel M, Zurawski JA, Snyder L, Phillips P, Satishchandran C (2000) Chain reaction cloning: a one-step method for directional ligation of multiple DNA fragments. Gene 243:19–25

    Article  Google Scholar 

  • Penchovsky R, Ackermann J (2003) DNA library design for molecular computation. J Comput Biol 10(2):215–230

    Article  Google Scholar 

  • Păun Gh, Rozenberg G, Salomaa A (1998) DNA computing. New computing paradigms. Springer, Berlin

    MATH  Google Scholar 

  • Reif JH, LaBean TH, Pirrung M, Rana VS, Guo B, Kingsford C, Wickham GS (2002) Experimental construction of very large scale DNA databases with associative search capability. In: Jonoska N et al (eds) Revised selected papers from DNA 7, LNCS 2340, Springer-Verlag, pp 231–247

  • Rothemund PWK (1996) A DNA and restriction enzyme implementation of turing machines. In: Lipton RJ et al (eds) DNA based computers. Proceedings of a DIMACS 27. Princeton University, American Mathematical Society, pp 75–119

  • Rothemund P (2006) Folding DNA to create nanoscale shapes and patterns. Nature 440:297–302

    Article  Google Scholar 

  • Rozenberg G, Salomaa A (1997) Handbook of formal languages, vol 3. Springer-Verlag, Berlin

    MATH  Google Scholar 

  • Rozenberg G, Spaink H (2003) DNA computing by blocking. Theoret Comput Sci 292:653–665

    Article  MathSciNet  MATH  Google Scholar 

  • Sakamoto K, Kiga D, Komiya K, Gouzu H, Yokoyama S, Ikeda S, Sugiyama H, Hagiya M (1999) State transitions by molecules. In: Kari L et al (eds) Bio systems—special issue. Proceedings of The fourth international meeting on DNA based computers, vol 52, pp 81–91

  • Yurke B, Turberfield A, Mills A, Simmel F, Neumann J (2000) A DNA-fuelled molecular machine made of DNA. Nature 406:605–608

    Article  Google Scholar 

  • Winfree E, Eng T, Rozenberg G (2001) String tile models for DNA computing by self-assembly. In: Condon A et al (eds) Revised selected papers from DNA 6, LNCS 2054, Springer, pp 63–88

  • Zhang Y, Seeman NC (1994) The construction of a DNA truncated octahedron. J Am Chem Soc 116:1661–1669

    Article  Google Scholar 

Download references

Acknowledgements

The experimental research reported in this paper was funded by the Italian National Research Project FIRB 2003, RBA01PHZS. The experiments were performed at the laboratories of the Department of General Pathology at University of Verona, and the authors wish to thank Cinzia Giagulli and Carlo Laudanna for their technical support. They are also grateful for very helpful comments and suggestions of anonymous referees. The first author is thankful for the interesting discussions with Susannah Gal and Tony Macula (from SUNY Binghamton University, USA) about experimental and combinatorial analyses of XPCR protocol.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Verona, Strada Le Grazie 15, 37134, Verona, Italy

    Giuditta Franco & Vincenzo Manca

Authors
  1. Giuditta Franco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vincenzo Manca
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giuditta Franco.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Franco, G., Manca, V. Algorithmic applications of XPCR. Nat Comput 10, 805–819 (2011). https://doi.org/10.1007/s11047-010-9199-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-010-9199-8

Keywords

Search

Navigation