Text algorithms
String matching in Lempel-Ziv compressed strings
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Estimating DNA sequence entropy
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Optimal suffix tree construction with large alphabets
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Some Theory and Practice of Greedy Off-Line Textual Substitution
DCC '98 Proceedings of the Conference on Data Compression
Grammar-based codes: a new class of universal lossless source codes
IEEE Transactions on Information Theory
Prime normal form and equivalence of simple grammars
Theoretical Computer Science - Implementation and application of automata
Efficient memory representation of XML document trees
Information Systems
Context-Sensitive Grammar Transform: Compression and Pattern Matching
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
On the Value of Multiple Read/Write Streams for Data Compression
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
A bisection algorithm for grammar-based compression of ordered trees
Information Processing Letters
Fast and Compact Web Graph Representations
ACM Transactions on the Web (TWEB)
Leaf languages and string compression
Information and Computation
Theoretical Computer Science
Pattern matching in lempel-Ziv compressed strings: fast, simple, and deterministic
ESA'11 Proceedings of the 19th European conference on Algorithms
Scalable detection of frequent substrings by grammar-based compression
DS'11 Proceedings of the 14th international conference on Discovery science
Fast q-gram mining on SLP compressed strings
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Efficient memory representation of XML documents
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Functional programs as compressed data
PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Random access to grammar-compressed strings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The lempel-ziv complexity of fixed points of morphisms
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Querying and embedding compressed texts
MFCS'06 Proceedings of the 31st 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
Prime normal form and equivalence of simple grammars
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Faster approximate pattern matching in compressed repetitive texts
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A faster grammar-based self-index
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Indexed multi-pattern matching
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Tracing compressed curves in triangulated surfaces
Proceedings of the twenty-eighth annual symposium on Computational geometry
An efficient algorithm to test square-freeness of strings compressed by straight-line programs
Information Processing Letters
Fast relative lempel-ziv self-index for similar sequences
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
New algorithms for unification modulo one-sided distributivity and its variants
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Faster fully compressed pattern matching by recompression
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Self-Indexed Grammar-Based Compression
Fundamenta Informaticae
Speeding up q-gram mining on grammar-based compressed texts
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Algorithms and limits for compact plan representations
Journal of Artificial Intelligence Research
Processing compressed texts: a tractability border
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Efficient LZ78 factorization of grammar compressed text
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Improved grammar-based compressed indexes
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Variable-Length codes for space-efficient grammar-based compression
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Fast q-gram mining on SLP compressed strings
Journal of Discrete Algorithms
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
On compressing and indexing repetitive sequences
Theoretical Computer Science
Compressed automata for dictionary matching
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Fingerprints in compressed strings
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
On the value of multiple read/write streams for data compression
Information Theory, Combinatorics, and Search Theory
Finding the smallest binarization of a CFG is NP-hard
Journal of Computer and System Sciences
A quadsection algorithm for grammar-based image compression
Integrated Computer-Aided Engineering - Anniversary Volume: Celebrating 20 Years of Excellence
| Hi-index | 5.23 |
We introduce new type of context-free grammars, AVL-grammars, and show their applicability to grammar-based compression. Using this type of grammars we present O(n log |Σ|) time and O(log n)-ratio approximation of minimal grammar-based compression of a given string of length n over an alphabet Σ and O(k log n) time transformation of LZ77 encoding of size k into a grammar-based encoding of size O(k log n). A preliminary version of this paper has been presented in Rytter (Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 2373, Springer, Berlin, June 2000, pp. 20-31), independently of Charikar et al. (STOC, 2002), where grammar-based approximation has been attacked with different construction and a more complicated type of grammars (α-balanced grammars for α ≤ 1 - ½ √2). The AVL-grammar is a very natural and simple tool for grammar based compression, it is a straightforward extension of the classical AVL-tree.