DNA recombination by XPCR

Authors:
Giuditta Franco;Vincenzo Manca;Cinzia Giagulli;Carlo Laudanna
Affiliations:
Department of Computer Science, University of Verona, Italy;Department of Computer Science, University of Verona, Italy;Section of General Pathology, Department of Pathology, University of Verona, Italy;Section of General Pathology, Department of Pathology, University of Verona, Italy
Venue:
DNA'05 Proceedings of the 11th international conference on DNA Computing
Year:
2005

Citing 6
Cited 3

Molecular computation of solutions to combinatorial problems

Science
Solution of a Satisfiability Problem on a Gel-Based DNA Computer

DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
A Clause String DNA Algorithm for SAT

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Computation by Self-assembly of DNA Graphs

Genetic Programming and Evolvable Machines
DNA extraction by XPCR

DNA'04 Proceedings of the 10th international conference on DNA computing
Efficient initial pool generation for weighted graph problems using parallel overlap assembly

DNA'04 Proceedings of the 10th international conference on DNA computing

Algorithmic applications of XPCR

Natural Computing: an international journal
A polymerase based algorithm for SAT

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Comparison of different methods to analyze a DNA computing library using the polymerase chain reaction

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

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.