A New Attempt for Satisfiability Problem: 3D DNA Self-Assembly to Solve SAT Problem

Abstract

The computational speed of an algorithm is very important to NP-hard problems. The 3D DNA self-assembly algorithm is faster than 2D, while 2D is faster than traditional algorithms because DNA molecule owns high parallelism and density. In this paper we mainly introduced how the 3D DNA self-assembly solves the SAT problems. Firstly, we introduced a non-deterministic algorithm. Secondly, we designed seed configuration and different types of DNA tiles which are needed in the computation. Lastly, we demonstrated how the 3D DNA self-assembly solves the SAT problem. In this paper, 3D DNA self-assembly algorithm has a constant tile types, and whose computation time is linear. © Springer-Verlag Berlin Heidelberg 2013.