A fully linear-time approximation algorithm for grammar-based compression
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1149447 (Why is no real title available?)
- scientific article; zbMATH DE number 2087040 (Why is no real title available?)
- scientific article; zbMATH DE number 2119662 (Why is no real title available?)
- A fully linear-time approximation algorithm for grammar-based compression
- A universal algorithm for sequential data compression
- Algorithms on Strings, Trees and Sequences
- Approximating the smallest grammar
- Collage system: A unifying framework for compressed pattern matching.
- Compression of individual sequences via variable-rate coding
- Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models
- Grammar-based codes: a new class of universal lossless source codes
- On-line versus off-line computation in dynamic text compression
- The macro model for data compression (extended abstract)
- Universal lossless compression via multilevel pattern matching
Cited in
(26)- Automata, Languages and Programming
- Grammar compressed sequences with rank/select support
- Compressibility of Finite Languages by Grammars
- An Efficient LLL Gram Using Buffered Transformations
- A \textit{really} simple approximation of smallest grammar
- Approximation of smallest linear tree grammar
- One-dimensional staged self-assembly
- Universal compressed text indexing
- Lyndon factorization of grammar compressed texts revisited
- Linear-time text compression by longest-first substitution
- A fully linear-time approximation algorithm for grammar-based compression
- Approximation of grammar-based compression via recompression
- Grammar-Based Compression in a Streaming Model
- String Processing and Information Retrieval
- Faster compressed suffix trees for repetitive collections
- Rpair: rescaling RePair with Rsync
- One-dimensional staged self-assembly
- Document listing on repetitive collections with guaranteed performance
- Constructing small tree grammars and small circuits for formulas
- Practical compressed suffix trees
- Quasi-distinct Parsing and Optimal Compression Methods
- Functional programs as compressed data
- One-variable word equations in linear time
- A self-index on block trees
- On the compressibility of finite languages and formal proofs
- Approximation of Grammar-Based Compression via Recompression
This page was built for publication: A fully linear-time approximation algorithm for grammar-based compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2569418)
