Start Submission Become a Reviewer

Reading: An Improved Parallel DNA Algorithm of 3-SAT


A- A+
dyslexia friendly

Research Papers

An Improved Parallel DNA Algorithm of 3-SAT


Wei Liu ,

College of Mathematics and Information, Lu Dong University, Yantai 264025
X close

Shou Xia Sun,

Beijing University of Technology, The College of Applied Science, Beijing100022
X close

Ying Guo

Department of Communication Engineering, Central South University, Changsha 410083
X close


There are many large-size and difficult computational problems in mathematics and computer science. For many of these problems, traditional computers cannot handle the mass of data in acceptable timeframes, which we call an NP problem. DNA computing is a means of solving a class of intractable computational problems in which the computing time grows exponentially with problem size. This paper proposes a parallel algorithm model for the universal 3-SAT problem based on the Adleman-Lipton model and applies biological operations to handling the mass of data in solution space. In this manner, we can control the run time of the algorithm to be finite and approximately constant.
How to Cite: Liu, W., Sun, S.X. & Guo, Y., (2007). An Improved Parallel DNA Algorithm of 3-SAT. Data Science Journal. 6, pp.S566–S570. DOI:
Published on 20 Sep 2007.
Peer Reviewed


  • PDF (EN)

    comments powered by Disqus