A novel and fast parallel solution for the vertex cover problem on DNA-based supercomputing

  title={A novel and fast parallel solution for the vertex cover problem on DNA-based supercomputing},
  author={Xu Zhou and Guangxue Yue and Kenli Li and Xiang Yu and Renfa Li},
  journal={2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)},
The volume's exponential explosion problem has been the critical factor that constraints the development of the DNA computing. For the objective to decrease the DNA volume complex of the vertex cover problem which is a famous NP-complete problem, a new DNA algorithm is advanced. The new algorithm consists of a parallel reducer, a solution generator, a dense parallel searcher, a sparse parallel searcher and a vertex cover searcher. In a computer simulation, the DNA strands of maximum number… CONTINUE READING


Publications referenced by this paper.

Genetic algorithm in DNA Computing: A solution to the maximal clique problem,'

Y. Li
  • Chinese Science Bulletin,
  • 2004

Solve partition problem by sticker model in DNA computing,'

Q. Huiqin, L. Mingming
  • Progress in Nature Science,
  • 2004

Rothemund,et aI, "Solution of a satisfiability problem on a gel-based DNA computer,'"in

R. S. Braich, P.W.K.C. Johnson
  • Proc. of the Sixth International Conference on DNA Computation (DNA
  • 2000

The Experimentation of Molecular Biology

S. D. Lu
  • Peking Union Medical College Press
  • 1999