Referenced Items are not available for this document.
The Shortest Superstring Problem is to find a shortest possible string that contains every string in a given set as substrings. This problem has applications to data compression and DNA sequencing. As the problem is NP-hard and MAX SNP-hard, approximation algorithms are of interest. We present a new algorithm which always finds a superstring that is at most 2.89 times as long as the shortest superstring. Our result improves the 3-approximation result of Blum, Jiang, Li, Tromp, and Yannakakis (1991)
Published in:
Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on
Date of Conference: 3-5 Nov 1993
- Page(s):
- 158 - 165
- Meeting Date :
- 03 Nov 1993-05 Nov 1993
- Print ISBN:
- 0-8186-4370-6
- INSPEC Accession Number:
- 4851319
- Conference Location :
- Palo Alto, CA
- Digital Object Identifier :
- 10.1109/SFCS.1993.366871
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
