Prev. Article Next Article Table of Contents

Research Article

Solving the 3-SAT Problem Based on DNA Computing

Supporting Info

Wenbin Liu,*^†^‡ Lin Gao,^§ Xiangrong Liu,^† Shudong Wang,^†^‡ and Jin Xu^†

Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan City 430074, China, College of Computers, Xidian University, Xian City, 710071, China, and College of Information Science and Engineering, Shandong University of Science and Technology, Taian City 271019, China

J. Chem. Inf. Comput. Sci., 2003, 43 (6), pp 1872–1875

DOI: 10.1021/ci034113o

Publication Date (Web): September 13, 2003

Corresponding author e-mail: wbliu@mail.hust.edu.cn, wbliu69@sohu.com.

†

Huazhong University of Science and Technology.

‡

Shandong University of Science and Technology.

Xidian University.

Abstract

The 3-SAT problem is an NP-complete problem, and many algorithms based on DNA computing have been proposed for solving it since Adleman's pioneering work. This paper presents a new algorithm based on the literal string strategy proposed by Sakamoto et al. Simulation results show that the maximal number of literal strings produced during the computing process is greatly reduced. Moreover, the length of the literal strings is also reduced from m to n at most.

View: Full Text HTML | Hi-Res PDF