DNA extraction by XPCR

Authors:
Giuditta Franco;Cinzia Giagulli;Carlo Laudanna;Vincenzo Manca
Affiliations:
Department of Computer Science, University of Verona;Section of General Pathology, Department of Pathology, University of Verona;Section of General Pathology, Department of Pathology, University of Verona;Department of Computer Science, University of Verona
Venue:
DNA'04 Proceedings of the 10th international conference on DNA computing
Year:
2004

Citing 6
Cited 2

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
DNA computing by blocking

Theoretical Computer Science - Algorithms,automata, complexity and games
Is DNA computing viable for 3-SAT problems?

Theoretical Computer Science
An algorithmic analysis of DNA structure

Soft Computing - A Fusion of Foundations, Methodologies and Applications

DNA recombination by XPCR

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The extraction of DNA strands including a given sequence of bases is a crucial step in the Adleman-Lipton extract model of DNA computing. In this paper, a special type of PCR is presented with a related algorithm which performs a specified extraction from a given pool of DNA double stranded (shortly dsDNA) molecules. This kind of PCR, called Cross Pairing PCR (shortly XPCR) was tested in several situations, and used in a biotechnological procedure which implements the extraction algorithm.