Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
A new algorithm for data compression
The C Users Journal
Text algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Approximating the smallest grammar: Kolmogorov complexity in natural models
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Algorithms on Compressed Strings and Arrays
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Offline Dictionary-Based Compression
DCC '99 Proceedings of the Conference on Data Compression
Inferring Lexical and Grammatical Structure from Sequences
SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Application of Lempel--Ziv factorization to the approximation of grammar-based compression
Theoretical Computer Science
Phrase Hierarchy Inference and Compression in Bounded Space
DCC '98 Proceedings of the Conference on Data Compression
Identifying hierarchical structure in sequences: a linear-time algorithm
Journal of Artificial Intelligence Research
Grammar-based codes: a new class of universal lossless source codes
IEEE Transactions on Information Theory
Universal lossless compression via multilevel pattern matching
IEEE Transactions on Information Theory
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
Theoretical Computer Science
Computing longest common substring and all palindromes from compressed strings
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Testing square-freeness of strings compressed by balanced straight line program
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Hi-index | 0.00 |
There is a close relationship between formal language theory and data compression. Since 1990’s various types of grammar-based text compression algorithms have been introduced. Given an input string, a grammar-based text compression algorithm constructs a context-free grammar that only generates the string. An interesting and challenging problem is pattern matching on context-free grammars $\mathcal{P}$ of size m and $\mathcal{T}$ of size n, which are the descriptions of pattern string P of length M and text string T of length N, respectively. The goal is to solve the problem in time proportional only to m and n, not to M nor N. Kieffer et al. introduced a very practical grammar-based compression method called multilevel pattern matching code (MPM code). In this paper, we propose an efficient pattern matching algorithm which, given two MPM grammars $\mathcal{P}$ and $\mathcal{T}$, performs in O(mn2) time with O(mn) space. Our algorithm outperforms the previous best one by Miyazaki et al. which requires O(m2n2) time and O(mn) space.