Approximating the smallest grammar: Kolmogorov complexity in natural models
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximation algorithms for grammar-based compression
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Collage system: a unifying framework for compressed pattern matching
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Application of Lempel--Ziv factorization to the approximation of grammar-based compression
Theoretical Computer Science
Compressed Pattern Matching for Sequitur
DCC '01 Proceedings of the Data Compression Conference
Architecture for Efficient Implementation of the YK Lossless Data Compression Algorithm
DCC '01 Proceedings of the Data Compression Conference
Compressing XML with Multiplexed Hierarchical PPM Models
DCC '01 Proceedings of the Data Compression Conference
Data Coding by Linear Forms of Numerical Sequences
Cybernetics and Systems Analysis
A nearly-optimal Fano-based coding algorithm
Information Processing and Management: an International Journal
Server-friendly delta compression for efficient web access
Web content caching and distribution
SGA: A grammar-based alignment algorithm
Computer Methods and Programs in Biomedicine
Compression of Annotated Nucleotide Sequences
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
XML compression techniques: A survey and comparison
Journal of Computer and System Sciences
Quasi-distinct Parsing and Optimal Compression Methods
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
IEEE Transactions on Information Theory
Structural complexity of random binary trees
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
On compressing the textual web
Proceedings of the third ACM international conference on Web search and data mining
A fully linear-time approximation algorithm for grammar-based compression
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
IEEE Transactions on Information Theory
A bisection algorithm for grammar-based compression of ordered trees
Information Processing Letters
Natural Language Compression on Edge-Guided text preprocessing
Information Sciences: an International Journal
Scalable detection of frequent substrings by grammar-based compression
DS'11 Proceedings of the 14th international conference on Discovery science
On families of new adaptive compression algorithms suitable for time-varying source data
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
Approximability of minimum AND-Circuits
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Random access to grammar-compressed strings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Quasi-distinct parsing and optimal compression methods
Theoretical Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Searching for smallest grammars on large sequences and application to DNA
Journal of Discrete Algorithms
An efficient pattern matching algorithm on a subclass of context free grammars
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Choosing word occurrences for the smallest grammar problem
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Grammar-based compression in a streaming model
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
A fast and efficient nearly-optimal adaptive Fano coding scheme
Information Sciences: an International Journal
Improving time and space complexity for compressed pattern matching
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Self-Indexed Grammar-Based Compression
Fundamenta Informaticae
Improved grammar-based compressed indexes
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
ESP-index: A compressed index based on edit-sensitive parsing
Journal of Discrete Algorithms
An effective heuristic for the smallest grammar problem
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Discrete Tomography Data Footprint Reduction via Natural Compression
Fundamenta Informaticae - Strategies for Tomography
A quadsection algorithm for grammar-based image compression
Integrated Computer-Aided Engineering - Anniversary Volume: Celebrating 20 Years of Excellence
| Hi-index | 754.96 |
We investigate a type of lossless source code called a grammar-based code, which, in response to any input data string x over a fixed finite alphabet, selects a context-free grammar Gx representing x in the sense that x is the unique string belonging to the language generated by Gx. Lossless compression of x takes place indirectly via compression of the production rules of the grammar Gx. It is shown that, subject to some mild restrictions, a grammar-based code is a universal code with respect to the family of finite-state information sources over the finite alphabet. Redundancy bounds for grammar-based codes are established. Reduction rules for designing grammar-based codes are presented