Abstract
In the primitive greedy algorithm for shortest superstring, if a pair of strings with maximum overlap picked out, they are subsequently merged. In this paper, we introduce the concept of optimal set and generalize the primitive greedy algorithm. The generalized algorithm can be reduced to the primitive greedy algorithm if the relative optimal set is empty. Consequently, the new algorithm achieves a better bound at the expense of cost. But the cost is acceptable in practice.
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
Armen, C., Stein, C.: A 2 2/3-approximation algorithm for the shortest superstring problem. In: CPM, pp. 87–101 (1996)
Blum, A., Jiang, T., Li, M., Tromp, J., Yannakakis, M.: Linear approximation of shortest superstrings. Journal of ACM 41(4), 630–647 (1994)
Breslauer, D., Jiang, T., Jiang, Z.: Rotations of periodic strings and short superstrings. J. Algorithms 24(2), 340–353 (1997)
Czumaj, A., Gasieniec, L., Piotrow, M., Rytter, W.: Parallel and sequential approximations of shortest superstrings. In: Scandinavian Workshop on Algorithm Theory, pp. 95–106 (1994)
Kaplan, H., Shafrir, N.: The greedy algorithm for shortest superstrings. Inf. Process. Lett. 93(1), 13–17 (2005)
Lesk, A. (ed.): Computational Molecular Biology, sources and methods for sequence analysis. Oxford University Press, Oxford (1988)
Li, M.: Towards a DNA sequencing theory. In: 31st IEEE Symp. on Foundations of Computer Science, pp. 125–134 (1990)
Gallant, J., Maier, D., Storer, J.: On finding minimal length superstrings. Journal of Computer and System Sciences 20, 50–58 (1980)
Peltola, H., Soderlund, H., Tarhio, J., Ukkonen, E.: Algorithms for some string matching problems arising in molecular genetics. In: Proc. IFIP Congress, pp. 53–64 (1983)
Sweedyk, Z.: A 2 1/2-approximation algorithm for shortest superstring. SIAM J. Comput. 29(3), 954–986 (1999)
Vazirani, V.: Approximation algorithm, pp. 61–66. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Cao, Z., Liu, L., Markowitch, O. (2009). Generalized Greedy Algorithm for Shortest Superstring. In: Zhou, J. (eds) Complex Sciences. Complex 2009. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02469-6_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-02469-6_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02468-9
Online ISBN: 978-3-642-02469-6
eBook Packages: Computer ScienceComputer Science (R0)