An analysis of the longest match and the greedy heuristics in text encoding

DOI10.1145/128749.128751zbMath0799.68199OpenAlexW2037950039MaRDI QIDQ4302811

Jyrki Katajainen, Timo Raita

Publication date: 13 November 1994

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/128749.128751

zbMATH Keywords

shortest pathstext compressionoptimal encodingdictionariesheuristic encodingtextual substitution

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (5)

The fractional greedy algorithm for data compression ⋮ Dictionary-symbolwise flexible parsing ⋮ Dictionary-Symbolwise Flexible Parsing ⋮ Bicriteria Data Compression ⋮ Worst-case analysis of the iterated longest fragment algorithm

This page was built for publication: An analysis of the longest match and the greedy heuristics in text encoding