On the performance of data compression algorithms based upon string matching

DOI10.1109/18.650987MaRDI QIDQ4392484zbMATH OpenOpenAlexFDO

Authors Enhui Yang, John C. Kieffer

Publication date 9 February 1999

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.650987

zbMATH Keywords

data compressionrate distortion functionstring matching

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Recommendations

• scientific article; zbMATH DE number 868046
• A suboptimal lossy data compression based on approximate pattern matching
• Universal Data Compression Algorithm Based on Approximate String Matching
• Optimal data compression algorithm

Cited in

(17)

• The asymptotics of waiting times between stationary processes, allowing distortion
• Large deviations for template matching between point processes
• Stochastic sub-additivity approach to the conditional large deviation principle
• Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
• Compression-based distance between string data and its application to literary work classification based on authorship
• Fast gapped variants for Lempel-Ziv-Welch compression
• Compressed data structures for strings. On searching and extracting strings from compressed textual data
• scientific article; zbMATH DE number 1187491 (Why is no real title available?)
• A suboptimal lossy data compression based on approximate pattern matching
• scientific article; zbMATH DE number 1490000 (Why is no real title available?)
• The asymptotics of string matching probabilities for Gaussian random sequences
• scientific article; zbMATH DE number 1790365 (Why is no real title available?)
• Source coding, large deviations, and approximate pattern matching
• Pattern matching and lossy data compression on random fields
• scientific article; zbMATH DE number 868046 (Why is no real title available?)
• Match-length functions for data compression
• Universal Data Compression Algorithm Based on Approximate String Matching

This page was built for publication: On the performance of data compression algorithms based upon string matching

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