DNA Computing towards the Solution of Minimum Vertex Cover Problem

1J. Kavitha

166 Views
49 Downloads
Abstract:

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.

Keywords:

Adleman-Lipton Model, Parallel Computing, MVCP, Watson-Crick Complementarity, NPComplete Problem, DNA Computing.

Paper Details
Month5
Year2020
Volume24
IssueIssue 5
Pages6807-6811