Abstract
We investigate the greedy algorithm for the shortest common superstring problem. For a restricted class of orders in which strings are merged, we show that the length of the greedy superstring is upper-bounded by the sum of the length of an optimal superstring and an optimal cycle cover. Thus in this restricted setting we verify the well known conjecture, that the performance ratio of the greedy algorithm is within a factor of two of the optimum and actually extend the conjecture considerably.
We achieve this by systematically combining known conditional inequalities about overlaps, period- and string-lengths, with a new familiy of string inequalities. It can be shown that conventional systems of conditional inequalities, including the Monge inequalities are insufficient to obtain our result.
Partially supported by DFG grant SCHN 503/2-1
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blum, A., Jiang, T., Li, M., Tromp, J., Yannakakis, M.: Linear approximation of shortest superstrings. Journal of the ACM 41(4), 630–647 (1994)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)
Monge, G.: Mémoire sur la théorie des déblais et des remblais. Histoire de l’Academie Royale des Sciences, Annés MDCCLXXXI, avec les Mémoires de Mathématique et de Physique, pour la même Année, Tirés des Registres de cette Académie 666–704 (1781)
Sweedyk, Z.: A 2\(\frac{1}{2}\)-approximation algorithm for shortest superstring. SIAM J. Comput. 29(3), 954–986 (1999)
Weinard, M., Schnitger, G.: On the greedy superstring conjecture, extended version available at http://www.thi.informatik.de/~weinard/index.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weinard, M., Schnitger, G. (2003). On the Greedy Superstring Conjecture. In: Pandya, P.K., Radhakrishnan, J. (eds) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2003. Lecture Notes in Computer Science, vol 2914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24597-1_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-24597-1_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20680-4
Online ISBN: 978-3-540-24597-1
eBook Packages: Springer Book Archive