A clause string DNA algorithm for SAT

DOI10.1007/3-540-48017-X_16MaRDI QIDQ4737647zbMATH OpenFDO

Authors Claudio Zandron, Vincenzo Manca

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2340/23400172.htm

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Protein sequences, DNA sequences (92D20)

Recommendations

• scientific article; zbMATH DE number 1735643
• Theoretical Computer Science
• A space-efficient randomized DNA algorithm for \textit{k}-SAT
• A DNA algorithm for the maximal matching problem
• A DNA-based random walk method for solving k-SAT
• A hybrid algorithm for the DNA sequencing problem
• Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.
• Strand Algebras for DNA Computing

Cited in

(9)

• Computing by polymerase chain reaction
• Autonomous resolution based on DNA strand displacement
• DNA Recombination by XPCR
• An Algorithm for SAT Without an Extraction Phase
• scientific article; zbMATH DE number 1735643 (Why is no real title available?)
• On the scalability of biocomputing algorithms: the case of the maximum clique problem
• scientific article; zbMATH DE number 1568795 (Why is no real title available?)
• Theoretical Computer Science
• Algorithmic applications of XPCR

This page was built for publication: A clause string DNA algorithm for SAT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737647)