A polymerase based algorithm for SAT

Authors:
Giuditta Franco
Affiliations:
Dept of Computer Science, University of Verona, Italy
Venue:
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Year:
2005

Citing 6
Cited 1

Molecular computation of solutions to combinatorial problems

Science
Generating hard satisfiability problems

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
DNA Computing in Microreactors

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Is DNA computing viable for 3-SAT problems?

Theoretical Computer Science
DNA recombination by XPCR

DNA'05 Proceedings of the 11th international conference on DNA Computing
DNA extraction by XPCR

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

Algorithmic applications of XPCR

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

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.