A New Biologically DNA Computational Algorithm to Solve the k-Vertex Cover Problem
The k-vertex cover problem aims to find a vertex cover set with k vertices in a given undirected graph. Based on biological molecular computation, the paper describes a new DNA procedure to solve K-vertex cover problem in O(n
2) time complexity,
which greatly simplifies the complexity of the computation.
Keywords: ADLEMAN-LIPTON MODEL; DNA COMPUTATION; NP-COMPLETE PROBLEM; THE K-VERTEX COVER PROBLEM
Document Type: Research Article
Publication date: 01 March 2015
- Journal of Computational and Theoretical Nanoscience is an international peer-reviewed journal with a wide-ranging coverage, consolidates research activities in all aspects of computational and theoretical nanoscience into a single reference source. This journal offers scientists and engineers peer-reviewed research papers in all aspects of computational and theoretical nanoscience and nanotechnology in chemistry, physics, materials science, engineering and biology to publish original full papers and timely state-of-the-art reviews and short communications encompassing the fundamental and applied research.
- Editorial Board
- Information for Authors
- Submit a Paper
- Subscribe to this Title
- Terms & Conditions
- Ingenta Connect is not responsible for the content or availability of external websites
- Access Key
- Free content
- Partial Free content
- New content
- Open access content
- Partial Open access content
- Subscribed content
- Partial Subscribed content
- Free trial content