@article{1550,
  author = {Kamran Khan Babar},
  title = {An Approach Towards the Solution of NP-Complete Problem},
  journal = {Journal of Information Technology Review},
  year = {2014},
  volume = {5},
  number = {3},
  doi = {},
  url = {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.},
}