Grammar-based codes: a new class of universal lossless source codes
From MaRDI portal
(Redirected from Publication:4503585)
Recommendations
- Structured grammar-based codes for universal lossless data compression.
- The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets
- Grammar-Based Lossless Universal Refinement Source Coding
- Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
- Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models
Cited in
(79)- XML compression techniques: A survey and comparison
- Approximability of minimum AND-circuits
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Structured grammar-based codes for universal lossless data compression.
- Linear-time text compression by longest-first substitution
- Inductive synthesis of cover-grammars with the help of ant colony optimization
- On the compressibility of finite languages and formal proofs
- Universal compressed text indexing
- The smallest grammar problem as constituents choice and minimal grammar parsing
- Collage system: A unifying framework for compressed pattern matching.
- Using ideas of Kolmogorov complexity for studying biological texts
- Time-universal data compression
- Compaction of Church numerals
- On the complexity of the smallest grammar problem over fixed alphabets
- Asymptotically most powerful tests for random number generators
- Grammar index by induced suffix sorting
- An LMS-based grammar self-index with local consistency properties
- On stricter reachable repetitiveness measures
- GraCT: a grammar-based compressed index for trajectory data
- Block trees
- Finger search in grammar-compressed strings
- Constructing small tree grammars and small circuits for formulas
- Grammar compressed sequences with rank/select support
- A fast and efficient nearly-optimal adaptive Fano coding scheme
- Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
- Universal codes as a basis for nonparametric testing of serial independence for time series
- A fully linear-time approximation algorithm for grammar-based compression
- Grammar-compressed indexes with logarithmic search time
- Faster repetition-aware compressed suffix trees based on block trees
- Sensitivity of string compressors and repetitiveness measures
- Self-indexed Text Compression Using Straight-Line Programs
- Syntactic methods for ECG signal diagnosis and QRS complexes recognition
- A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA
- Grammar-Based Tree Compression
- Performance Analysis of Grammar-Based Codes Revisited
- The Universality of Grammar-Based Codes for Sources With Countably Infinite Alphabets
- Grammar-Based Lossless Universal Refinement Source Coding
- Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata
- Quasi-distinct Parsing and Optimal Compression Methods
- In-place update of suffix array while recoding words
- A bisection algorithm for grammar-based compression of ordered trees
- Searching for smallest grammars on large sequences and application to DNA
- Quasi-distinct parsing and optimal compression methods
- Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models
- Universal lossless data compression with side information by using a conditional MPM grammar transform
- Textual data compression in computational biology: algorithmic techniques
- Using static suffix array in dynamic application: case of text compression by longest first substitution
- String attractors: verification and optimization
- Universal coding and prediction on ergodic random points
- Optimal rank and select queries on dictionary-compressed text
- Entropy lower bounds for dictionary compression
- Random access to grammar-compressed strings and trees
- Excess entropy in natural language: present state and perspectives
- Compressibility of Finite Languages by Grammars
- A FULLY COMPRESSED PATTERN MATCHING ALGORITHM FOR SIMPLE COLLAGE SYSTEMS
- Tracing compressed curves in triangulated surfaces
- Efficient construction of the BWT for repetitive text using string compression
- Substring complexities on run-length compressed strings
- Grammar-based compression and its use in symbolic music analysis
- Approximation ratios of \textsf{RePair}, \textsf{LongestMatch} and \textsf{Greedy} on unary strings
- Rpair: rescaling RePair with Rsync
- Faster repetition-aware compressed suffix trees based on block trees
- Computing all-vs-all MEMs in grammar-compressed text
- A simple grammar-based index for finding approximately longest common substrings
- Space-efficient conversions from SLPs
- Bat-LZ out of hell
- Substring complexity in sublinear space
- Constant-delay enumeration for SLP-compressed documents
- Computing MEMs and relatives on repetitive text collections
- Uniquely decodable n-gram embeddings
- On bounded redundancy of universal codes
- Universal codes as a basis for time series testing
- Logarithmic-time internal pattern matching queries in compressed and dynamic texts
- Counting on general run-length grammars
- Grammar index by induced suffix sorting
- Streaming periodicity with mismatches, wildcards, and edits
- Novel results on the number of runs of the Burrows-Wheeler-transform
- Variable-length coding of two-sided asymptotically mean stationary measures
This page was built for publication: Grammar-based codes: a new class of universal lossless source codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503585)
