All Published Papers Search Service

Title

The Semi-automated DNA Computing Model for solving the Satisfiability Problem

Author

Yin Zhixiang, Cui Jianzhong, Shi Xiaohong, Pan Linqiang

Vol. 6  No. 1  pp. 163~167

Abstract

To solve the general satisfiability problem, we present a semi-automated DNA computing model. Firstly, all potential solutions to the given satisfiability problem are generated. Secondly, we set the probes corresponding to every variable of satisfiability problem, and immobilize these probes to probe layers of semi-automated equipment for searching for all potential solutions automatically. Finally, we obtain the solutions to the satisfiability problem when the equipment is shut down. The model proposed here features: a) autoimmunization characteristic, b) a significant reduction in the loss of DNA strands compared with other solution-based DNA computing, c) ease in scaling up to solve general satisfiability problem having arbitrary variables and clauses.

Keywords

The satisfiability problem, SAT problem, DNA computing, Semi-automated equipment

URL