International Conference on Information Technology and Computer Science, 3rd (ITCS 2011)
7 DNA Sequencing and the Shortest Superstring Problem
Download citation file:
- Ris (Zotero)
- Reference Manager
Given a collection of strings over an alphabet Σ , a superstring s of S is a string containing each as a substring; that is, for each i, , s contains a block of consecutive characters that match exactly. The shortest superstring problem is the problem of finding a superstring s of minimum length. This problem is NP- hard and has applications in computational biology and data compression. In this paper, we characterize the shortest superstring as a Hamiltonian path in a directed graph, and introduce an efficient (polynomial time) approach for it.