Skip to Main Content
ASME Press Select Proceedings

International Conference on Information Technology and Computer Science, 3rd (ITCS 2011)

Editor
V. E. Muhin
V. E. Muhin
National Technical University of Ukraine
Search for other works by this author on:
W. B. Hu
W. B. Hu
Wuhan University
Search for other works by this author on:
ISBN:
9780791859742
No. of Pages:
656
Publisher:
ASME Press
Publication date:
2011

Given a collection of strings S={s1,,sn} over an alphabet Σ , a superstring s of S is a string containing each si as a substring; that is, for each i, 1<i<n, s contains a block of |si| consecutive characters that match si 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.

This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal