DNA and membrane algorithms for SAT
Some DNA algorithms proposed in the literature for propositional satisfiability (SAT) are analyzed. in the class of 'extract model' the two sub-classes of 'literal string' and 'clause string' algorithms are compared and a new formulation of these algorithms is given in terms of membrane systems. Then, the duality between literal string and clause string formulation of SAT is expressed by means of 'singleton matrices' that introduce another membrane algorithm for SAT. The analysis developed suggests the perspective of membrane systems as problem-solving agents based on molecule localization, transformation, and propagation.
propositional satisfiability membrane systems dna computing molecular computing unconventional computing models