DNA Computing towards the Solution of Minimum Vertex Cover Problem

DNA computing is an unconventional method for parallel computation. It is a technique proposed for finding solution to intractable computational problems. Computational hard problem in which the time complexity can increase exponentially with problem size. This work develops a new DNA exploring model to solve a minimum vertex cover problem (MVCP). This DNA processing model solve the MVCP in polynomial time calculation.