An Iterated Local Search Algorithm for the DNA Sequencing Problem
One important approach for DNA sequencing consists of finding a shortest string s that contains all the s
i as substrings for a set {s
1, s
2, s
n} of (adenine, guanine, cytosine, and thymine) strings. This problem
is modeled under the name the shortest superstring problem. In this paper, an iterated local search algorithm is proposed to solve this problem. Experiment results show that this algorithm can obtain higher quality solutions on DNA sequencing than those from other heuristics for many instances.
Keywords: DNA SEQUENCING; HEURISTIC; LOCAL SEARCH; SHORTEST SUPERSTRING
Document Type: Research Article
Publication date: 01 July 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