Algorithm of Solving the Maximum Edges Independent Set Problem Based on DNA Molecules Computation
The maximum edges independent set (MEIS) problem is a vitally important NP-complete problem in graph theory, having numerous real life applications. In this paper, we present a DNA algorithm for solving the MEIS problem with DNA molecular operations. We extend the application of DNA
molecular operations and simultaneity simplify the complexity of the computation.
Keywords: ADLEMAN-LIPTON MODEL; DNA COMPUTATION; NP-COMPLETE PROBLEM; THE MAXIMUM EDGES INDEPENDENT SET PROBLEM
Document Type: Research Article
Publication date: 01 April 2014
- 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