Approximating shortest superstrings

Authors:
Shang-Hua Teng;F. Yao
Affiliations:
Dept. of Math., MIT, Cambridge, MA, USA;-
Venue:
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Year:
1993

Citing 0
Cited 6

Why Greed Works for Shortest Common Superstring Problem

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Why greed works for shortest common superstring problem

Theoretical Computer Science
Viral genome compression

DNA'06 Proceedings of the 12th international conference on DNA Computing
A 6-approximation algorithm for computing smallest common aon-supertree with application to the reconstruction of glycan trees

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The Shortest Common Superstring Problem and Viral Genome Compression

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
A probabilistic PTAS for shortest common superstring

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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).