¡¡Chinese Journal of Computers   Full Text
  TitleA DNA Computation Model to Solve 0-1 Programming Problem
  AuthorsQIANG Xiao-Li1) ZENG Bo1) WANG Zi-Cheng1) KOU Zheng2)
  Address1)(Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074)
2)(State Key Laboratory of Virology, Wuhan Institute of Virology, Chinese Academy of Sciences, Wuhan 430071)
  Year2008
  IssueNo.12(2155¡ª2159)
  Abstract &
  Background 		Abstract DNA computing is a novel computation paradigm with DNA molecules as ¡®data¡¯, and encoding is a crucial problem with great difficulties of DNA computing. In this paper, a novel encoding method named double encoding method is proposed, which could make the procedure of solution detection similar to DNA sequencing technology. By using this method a DNA algorithm to solve 0-1 programming problem is proposed and PCR is done only 4 times of to detect the feasible solutions. Compared with other DNA computing algorithms, this method could be easier and faster to read out the solution.
Keywords DNA computing; 0-1 programming problem; encoding