Solving the SAT problem using a DNA computing algorithm based on ligase chain reaction.
A new DNA computing algorithm based on a ligase chain reaction is demonstrated to solve an SAT problem. The proposed DNA algorithm can solve an n-variable m-clause SAT problem in m steps and the computation time required is O (3m+n). Instead of generating the full-solution DNA library, we start with an empty test tube and then generate solutions that partially satisfy the SAT formula. These partial solutions are then extended step by step by the ligation of new variables using Taq DNA ligase. Correct strands are amplified and false strands are pruned by a ligase chain reaction (LCR) as soon as they fail to satisfy the conditions. If we score and sort the clauses, we can use this algorithm to markedly reduce the number of DNA strands required throughout the computing process. In a computer simulation, the maximum number of DNA strands required was 2(0.48n) when n=50, and the exponent ratio varied inversely with the number of variables n and the clause/variable ratio m/n. This algorithm is highly space-efficient and error-tolerant compared to conventional brute-force searching, and thus can be scaled-up to solve large and hard SAT problems.
Wang
Xiaolong
X
Department of Biotechnology, Ocean University of China, Qingdao 266003, People's Republic of China. xiaolong@ouc.edu.cn
Bao
Zhenmin
Z
Hu
Jingjie
J
Wang
Shi
S
Zhan
Aibin
A
D000465:Algorithms; D001483:Base Sequence; D003198:Computer Simulation; D004247:DNA / Q000235:genetics* / Q000378:metabolism*; D008025:Ligases / Q000378:metabolism*; D008969:Molecular Sequence Data; D012985:Software Design
D004247:DNA; D008025:Ligases