An Approach Towards the Solution of NP-Complete Problem
Kamran Khan Babar
Journal of Information Technology Review, Vol. 5, No. 3, 2014.
DOI: 
Link: http://www.dline.info/jitr/fulltext/v5n3/2.pdf
Abstract:
DNA Computing is hot topic and a substitute way for computational calculations. It is based on the statement that in general it is possible to design a sequence of biochemical tests including DNA elements which is comparative to processing information secured in these elements. Cookâ€™s Theorem informs that if one algorithm for an NP-complete or an NP-hard issue will be designed, then other issues will be fixed through reduction to that problem. The minimum vertex cover problem is a traditional classical graph optimization problem and has been proven to be NP-Complete problem. In this article, we present a DNA based algorithm for fixing the minimum vertex-cover problem.