Abstract
On-line text-compression algorithms are considered, where compression is done by substituting substrings of the text according to some fixed dictionary (code book). Due to the long running time of optimal compression algorithms, several on-line heuristics have been introduced in the literature. In this paper we continue the investigations of Katajainen and Raita [4]. We complete the worst-case analysis of the longest matching algorithm and of the differential greedy algorithm for several types of special dictionaries and derive matching lower and upper bounds for all variants of the problem in this context.
This research was partially supported by the Spezialforschungsbereich F003 “Optimierung und Kontrolle”, Projektbereich Diskrete Optimierung, by the Christian Doppier Laboratorium für Diskrete Optimierung and by a grant from the Hungarian Academy of Sciences (OTKA, No. T 016349).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Békési, G. Galambos, U. Pferschy, G.J. Woeginger, The fractional greedy algorithm for data compression, Report 292, Institute of Mathematics, Graz, 1994, to appear in Computing.
M.E. Gonzalez-Smith and J.A. Storer, Parallel algorithms for data compression, Journal of the ACM 32, 1985, 344–373.
J. Katajainen and T. Raita, An approximation algorithm for space-optimal encoding of a text, The Computer Journal 32, 1989, 228–237.
J. Katajainen and T. Raita, An analysis of the longest matching and the greedy heuristic in text encoding, Journal of the ACM 39, 1992, 281–294.
E.J. Schuegraf and H.S. Heaps, A comparison of algorithms for data base compression by use of fragments as language elements, Inf. Stor. Ret. 10, 1974, 309–319.
J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Trans. Inf. Theory 23, 1977, 337–343.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Békési, J., Galambos, G., Pferschy, U., Woeginger, G.J. (1996). Worst-case analysis for on-line data compression. In: Deza, M., Euler, R., Manoussakis, I. (eds) Combinatorics and Computer Science. CCS 1995. Lecture Notes in Computer Science, vol 1120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61576-8_90
Download citation
DOI: https://doi.org/10.1007/3-540-61576-8_90
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61576-7
Online ISBN: 978-3-540-70627-4
eBook Packages: Springer Book Archive