Title
A polymerase based algorithm for SAT
Abstract
A DNA algorithm based on polymerase extension and cutting operations is proposed to solve an instance of SAT with significant dimension. It suggests a combination of efficient DNA operations following the schema of the extract model. Its generating step is performed by a variant of a recently introduced technique called XPCR, while the extraction of the solutions is implemented by a combination of polymerase extension and restriction endonuclease action.
Year
DOI
Venue
2005
10.1007/11560586_20
ICTCS
Keywords
Field
DocType
efficient dna operation,significant dimension,restriction endonuclease action,extract model,dna algorithm,generating step,polymerase extension,restriction endonuclease,restriction enzyme,dna computing
Constraint satisfaction,Polymerase chain reaction,Computer science,Algorithm,Propositional calculus,DNA,Polymerase,Restriction enzyme,DNA computing
Conference
Volume
ISSN
ISBN
3701
0302-9743
3-540-29106-7
Citations 
PageRank 
References 
2
0.37
8
Authors
1
Name
Order
Citations
PageRank
Giuditta Franco113618.34