Tight bounds for compressing substring samples

DOI10.4230/LIPICS.CPM.2024.9MaRDI QIDQ6891089zbMATH OpenFDO

Authors Philip Bille, Christian Mikkelsen Fuglsang, Inge Li Gørtz

Publication date 2 December 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2024.9

zbMATH Keywords

algorithmscompressionLempel-Ziv

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites work

• A universal algorithm for sequential data compression
• An Online Algorithm for Finding the Longest Previous Factors
• Approximating LZ77 via Small-Space Multiple-Pattern Matching
• Compression of individual sequences via variable-rate coding
• Computing Lempel-Ziv factorization online
• Data compression via textual substitution
• Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models
• Faster compact on-line Lempel-Ziv factorization
• Faster lightweight Lempel-Ziv parsing
• Finding approximate repetitions under Hamming distance.
• Grammar-Based Compression in a Streaming Model
• scientific article; zbMATH DE number 1149447 (Why is no real title available?)
• Lempel Ziv computation in small space (LZ-CISS)
• Lempel-Ziv Compression in a Sliding Window
• Lempel-Ziv Factorization Revisited
• Lempel-Ziv factorization: simple, fast, practical
• Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
• On the Complexity of Finite Sequences
• Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval

This page was built for publication: Tight bounds for compressing substring samples

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