LZ-End Parsing in Linear Time
From MaRDI portal
Publication:5111742
DOI10.4230/LIPIcs.ESA.2017.53zbMath1442.68050OpenAlexW2758331792MaRDI QIDQ5111742
Dmitry Kosolobov, Dominik Kempa
Publication date: 27 May 2020
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7847/pdf/LIPIcs-ESA-2017-53.pdf/
Analysis of algorithms (68W40) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (6)
On the approximation ratio of LZ-end to LZ77 ⋮ Lempel-Ziv-like parsing in small space ⋮ On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation ⋮ Bidirectional Text Compression in External Memory ⋮ A Space-Optimal Grammar Compression. ⋮ LZ-End Parsing in Linear Time
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On compressing and indexing repetitive sequences
- Indexing text using the Ziv--Lempel trie
- Surpassing the information theoretic bound with fusion trees
- A data structure for dynamic trees
- Optimal bounds for the predecessor problem
- A Faster Grammar-Based Self-index
- Weighted Ancestors in Suffix Trees
- Time-space trade-offs for predecessor search
- Compressed representations of sequences and full-text indexes
- Faster Lightweight Lempel-Ziv Parsing
- Hybrid indexes for repetitive datasets
- Self-indexing Based on LZ77
- Faster Approximate Pattern Matching in Compressed Repetitive Texts
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- Design and implementation of an efficient priority queue
- A universal algorithm for sequential data compression
- Jewels of Stringology
- Range Predecessor and Lempel-Ziv Parsing
- Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
- LZ-End Parsing in Linear Time
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- LZ77-Based Self-indexing with Faster Pattern Matching
- Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
This page was built for publication: LZ-End Parsing in Linear Time
