A Clause String DNA Algorithm for SAT

A DNA algorithm for SAT, the satisfiability of propositional formulae, is presented where the number of separation steps is given by the number of clauses of the instance. This represents a computational improvement for DNA algorithms based on Adleman and Lipton’s extraction model, where the number of separations equates the number of literals of the instance.

• Type: Conference
• Year: 2001
• Where: DNA
• Authors: Vincenzo Manca, Claudio Zandron
• Keywords: Bioinformatics, DNA 2001, Dna Algorithms, Lipton’s Extraction Model, Propositional Formulae