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

DOI10.1145/128749.128751zbMATH Open0799.68199OpenAlexW2037950039MaRDI QIDQ4302811FDOQ4302811

Authors: Jyrki Katajainen, T. 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

Recommendations

• Greedy Algorithms for On-Line Data Compression
• scientific article; zbMATH DE number 764405
• The fractional greedy algorithm for data compression

zbMATH Keywords

shortest pathsdictionariestext compressionoptimal encodingheuristic encodingtextual substitution

Mathematics Subject Classification ID

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

Cited In (8)

• Dictionary-symbolwise flexible parsing
• Dictionary-symbolwise flexible parsing
• Worst-case analysis of the iterated longest fragment algorithm
• Worst-case analysis for on-line data compression
• On the applicability of the longest-match rule in lexical analysis.
• The fractional greedy algorithm for data compression
• Title not available (Why is that?)
• Bicriteria data compression

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302811)