Solving the Clique Problem and the Vertev Cover Problem in Adleman-Lipton's Model

W.-L. Chang and M. Guo (PRC)

Keywords

Biological Computing, Molecular Computing, DNA-based Computing, the NP-complete Problem.

Abstract

In this paper, it is proved how the DNA (DeoxyriboNucleic Acid) operations proposed by Adleman and Lipton can be used for developing efficient DNA algorithms to solving the clique problem and the vertex cover problem.

Important Links:

• DOI:
• From Proceeding (368) Networks, Parallel and Distributed Processing, and Applications - 2002

Go Back