On design principles for a molecular computer
Communications of the ACM
Contextual insertions/deletions and computability
Information and Computation
Handbook of formal languages, vol. 3: beyond words
Handbook of formal languages, vol. 3: beyond words
String Tile Models for DNA Computing by Self-Assembly
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
Coding Properties of DNA Languages
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Theoretical Computer Science - Algorithms,automata, complexity and games
Computation by Self-assembly of DNA Graphs
Genetic Programming and Evolvable Machines
An algorithmic analysis of DNA structure
Soft Computing - A Fusion of Foundations, Methodologies and Applications
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
On the Logic and Geometry of Bilinear Forms
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
The many facets of natural computing
Communications of the ACM
A DNA computing inspired computational model
Theoretical Computer Science
Successful preparation and analysis of a 5-site 2-variable DNA library
Natural Computing: an international journal
DNA'05 Proceedings of the 11th international conference on DNA Computing
A polymerase based algorithm for SAT
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Efficient initial pool generation for weighted graph problems using parallel overlap assembly
DNA'04 Proceedings of the 10th international conference on DNA computing
Hi-index | 0.00 |
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.