DNA Origami Based Computing Model for the Satisfiability Problem

Abstract

The satisfiability problem (SAT) is one of the NP-complete problems in the fields of theoretical computer and artificial intelligence, is the core of NP-complete problems. Compared with traditional DNA self-assembly, DNA origami is a new method of DNA self-assembly. We first give a description and the status quo of study of the satisfiability problem, briefly introduce the principle of DNA origami, propose the computing model based on DNA origami to solve the satisfiability problem, and solve an instance with 3 variables, 3 clauses to illustrate the feasibility of the algorithm. The proposed model only uses gel electrophoresis to search the solution to the problem, which is the most reliable biological operation known to date, therefore the proposed model is feasible. At present, the reported results concerning using origami to solve the NP-complete problem is relatively few. Our method is a new attempt to solve the NP- complete problem using biological DNA molecules.