Rpair: rescaling RePair with Rsync
From MaRDI portal
Publication:6536245
Recommendations
Cites work
- A \textit{really} simple approximation of smallest grammar
- A fully linear-time approximation algorithm for grammar-based compression
- A space-optimal grammar compression
- A universal algorithm for sequential data compression
- Access, rank, and select in grammar-compressed strings
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Approximation of grammar-based compression via recompression
- Compressed indexing with signature grammars
- Data compression via textual substitution
- GraCT: a grammar-based compressed index for trajectory data
- Grammar-based codes: a new class of universal lossless source codes
- scientific article; zbMATH DE number 1149447 (Why is no real title available?)
- Indexing highly repetitive collections
- LZ77-based self-indexing with faster pattern matching
- On the Complexity of Finite Sequences
- Online LZ77 parsing and matching statistics with RLBWTs
- Practical compressed suffix trees
- Prefix-free parsing for building big BWTs
- Random access to grammar-compressed strings and trees
- Self-indexed grammar-based compression
- The Smallest Grammar Problem
- Time-space trade-offs for Lempel-Ziv compressed indexing
Cited in
(2)
This page was built for publication: Rpair: rescaling RePair with Rsync
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536245)