DNA Directed Model for Shortest Superstring Problem
DNA is increasingly being used as the engineering material of choice for the construction of nanoscale circuits, structures, and motors. Recent experimental and theoretical advances have produced and tested new methods to obtain large DNA word sets to support virtually any kind of applications. The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. This problem is NP-hard and has applications in computational biology and data compression. In this paper, we present a graph model of SCS problem. We characterize the shortest superstring as a Hamiltonian path in a directed graph and give a algotirhm for solving large SCS instances of biological sequences in linear time. As a general computational framework, this algorithm can also be applied on more general applications such as text comparison and compression, query optimization and scheduling.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
Document Type: Research Article
Publication date: 2011-10-01
More about this publication?
- 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