DNA Recombination by XPCR

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.

[1]  R J Lipton,et al.  DNA solution of hard computational problems. , 1995, Science.

[2]  L F Landweber,et al.  Molecular computation: RNA solutions to chess problems , 2000, Proc. Natl. Acad. Sci. USA.

[3]  Vincenzo Manca,et al.  A Clause String DNA Algorithm for SAT , 2001, DNA.

[4]  W. Stemmer.  DNA shuffling by random fragmentation and reassembly: in vitro recombination for molecular evolution. , 1994, Proceedings of the National Academy of Sciences of the United States of America.

[5]  T. Head.  Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. , 1987, Bulletin of mathematical biology.

[6]  Natasa Jonoska,et al.  Computation by Self-assembly of DNA Graphs , 2004, Genetic Programming and Evolvable Machines.

[7]  Byoung-Tak Zhang,et al.  Efficient Initial Pool Generation for Weighted Graph Problems Using Parallel Overlap Assembly , 2004, DNA.

[8]  R. Deaton,et al.  A DNA-based in vitro Genetic Program , 2005 .

[9]  M Hagiya,et al.  A DNA-based in vitroGenetic Program , 2002, Journal of biological physics.

[10]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[11]  Leonard M. Adleman,et al.  Solution of a Satisfiability Problem on a Gel-Based DNA Computer , 2000, DNA Computing.

[12]  Carlo Laudanna,et al.  DNA Extraction by XPCR , 2004, DNA.

[13]  P D Kaplan,et al.  Parallel overlap assembly for the construction of computational DNA libraries. , 1997, Journal of theoretical biology.

[14]  Clifford R. Johnson,et al.  Solution of a 20-Variable 3-SAT Problem on a DNA Computer , 2002, Science.