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 analyse two modified version of an old algorithm introduced by Shuegraf and Heaps [9]. We will investigate the worst case behaviour of this Longest Fragment First (LFF) algorithm for several types of special dictionaries.
This research was supported by a grant from the National Scientific Research Foundation (OTKA Nr. 16349).
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
J. Békési, G. Galambos, U. Pferschy, G. J. Woeginger, The Fractional Greedy Algorithm for Data Compression, Computing 56 (1), 1996, 29–46.
J. Békési, G. Galambos, U. Pferschy, G. J. Woeginger, Operations Research Proceedings, Ed. U. Derigs, A. Bachem, A. Drexl, Berlin, 1994, 76–80.
R. M. Fano, Transmission of information, Wiley, New York, 1961.
M. E. Gonzalez-Smith and J. A. Storer, Parallel algorithms for data compression, Journal of the ACM 32, 1985, 344–373.
D. A Huffman, A method for the construction od minimum-redundancy codes, Proc Institute of Electrical and Radio Engineers, 40 (9), 1952, 1098–1101.
F. Jelinek, K. Schneider, On variable length-to-block coding, IEEE-IT 18, 1972, 765–774
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.
J. J. Risassen, G. G. Langdon, Arithmetic coding, IBM J. Research and Development, 23 (2), 1979, 149–162.
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
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Békési, J., Galambos, G., Raita, T. (1998). Longest Fragment First Algorithms for Data Compression. In: Giannessi, F., Komlósi, S., Rapcsák, T. (eds) New Trends in Mathematical Programming. Applied Optimization, vol 13. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2878-1_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2878-1_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4793-2
Online ISBN: 978-1-4757-2878-1
eBook Packages: Springer Book Archive