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
A polymerase based algorithm for SAT
FRANCO, Giuditta
2005-01-01
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
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
