A greedy approximation algorithm for constructing shortest common superstrings
Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
Approximation algorithms for the shortest common superstring problem
Information and Computation
Linear approximation of shortest superstrings
Journal of the ACM (JACM)
More on the complexity of common superstring and supersequence problems
Theoretical Computer Science
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Rotations of periodic strings and short superstrings
Journal of Algorithms
\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
SIAM Journal on Computing
Approximation algorithms
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Shortest Common Superstrings for Strings of Random Letters
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Journal of the ACM (JACM)
An Experimental Comparison of Approximation Algorithms for the Shortest Common Superstring Problem
ENC '04 Proceedings of the Fifth Mexican International Conference in Computer Science
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM (JACM)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Towards a DNA sequencing theory (learning a string)
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Approximating shortest superstrings
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Why greed works for shortest common superstring problem
Theoretical Computer Science
The greedy algorithm for shortest superstrings
Information Processing Letters
Explicit inapproximability bounds for the shortest superstring problem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
IEEE Transactions on Information Theory
Hi-index | 5.23 |
We consider approximation algorithms for the shortest common superstring problem (SCS). It is well known that there is a constant f1 such that there is no efficient approximation algorithm for SCS achieving a factor of at most f in the worst case, unless P=NP. We study SCS on random inputs and present an approximation scheme that achieves, for every @e0, a (1+@e)-approximation in expected polynomial time. We also show that the greedy algorithm achieves approximation ratio 1+@e with probability exponentially close to 1. These results apply not only if the letters are chosen independently at random, but also to the more realistic mixing model, which allows dependencies among the letters of the random strings. Our results are based on a sharp tail bound on the optimal compression, which improves a previous result by Frieze and Szpankowski (1998).