Skip to main content

DNA Recombination by XPCR

  • Conference paper
DNA Computing (DNA 2005)

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

Included in the following conference series:

  • 815 Accesses

Abstract

The first step of the Adleman-Lipton extract model in DNA computing is the combinatorial generation of libraries. In this paper a new method is proposed for generating a initial pool, it is a quaternary recombination of strings via application of null context splicing rules. Its implementation, based on a kind of PCR called XPCR, results to be convenient with respect to the standard methods, in terms of efficiency, speed and feasibility. The generation algorithm we propose was tested by a lab experiment here described, since the presence of few sequences is enough for checking the completeness of the library. The simple technology of this approach is interesting in and of itself, and it can have many useful applications in biological contexts.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  3. Braich, R.S., Johnson, C., Rothemund, P.W.K., Hwang, D., Chelyapov, N., Adleman, L.M.: Solution of a Satisfiability Problem on a Gel-Based DNA Computers. In: Condon, A., Rozenberg, G. (eds.) Proceedings of 6th International Workshop On DNA Based Computers, pp. 31–42. Leiden Netherlands (2000)

    Google Scholar 

  4. Franco, G., Giagulli, C., Laudanna, C., Manca, V.: DNA Extraction by XPCR. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 106–114. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Franco, G.: Combinatorial Aspects of DNA Solution Spaces generated by XPCR Recombination (in preparation)

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Lee, J.Y., Lim, H.-W., Yoo, S.-I., Zhang, B.-T., Park, T.H.: Efficient Initial Pool Generation for Weighted Graph Problems Using Parallel Overlap Assembly. In: Mauri, G., Rozenberg, G., Zandron, C. (eds.) Preliminary Proceedings of the 10th International Meeting on DNA Based Computers, Milan, Italy, pp. 357–364 (2004)

    Google Scholar 

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

    Article  Google Scholar 

  10. Jonoska, N., Sa-Ardyen, P., Seeman, N.C.: Computation by self-assembly of DNA graphs. Journal of Genetic Programming and Evolvable Machines 4, 123–137 (2003)

    Article  MATH  Google Scholar 

  11. Kaplan, P.D., Ouyang, Q.O., Thaler, D.S., Libchaber, A.: Parallel overlap assembly for the construction of computational DNA libraries. J. Theor. Biol. 188, 333–341 (1997)

    Article  Google Scholar 

  12. 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 

  13. Rose, J.A., Hagiya, M., Deaton, R.J., Suyama, A.: A DNA-based in vitro Genetic program. Journal of Biological Physics 28(3), 493–498 (2002)

    Article  Google Scholar 

  14. Stemmer, W.: DNA shuffling by random fragmentation and reassembly: In vitro recombination for molecular evolution. Proc. Natl. Acad. Sci. USA 91, 10747–10751 (1994)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Franco, G., Manca, V., Giagulli, C., Laudanna, C. (2006). DNA Recombination by XPCR. In: Carbone, A., Pierce, N.A. (eds) DNA Computing. DNA 2005. Lecture Notes in Computer Science, vol 3892. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753681_5

Download citation

  • DOI: https://doi.org/10.1007/11753681_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34161-1

  • Online ISBN: 978-3-540-34165-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics