An improved pattern-matchingalgorithm for strings in terms of straight-line programs (2000)

by M Miyazaki, A Shinohara, M Takeda
Venue:Journal of Discrete Algorithms
Add To MetaCart
Results 1 - 1 of 1

Application of Lempel-Ziv factorization to the approximation of grammar-based compression

by Wojciech Rytter, Communicated D. Perrin , 2003
"... We introduce new type of context-free grammars, AVL-grammars, and show theirappl7#B#BZ87 to grammar-based compression. Using this type of grammars we present O(nl7 time and O(lZ n)-ratio approximation ofminimal grammar-based compression of a given string oflZM,k n over anal,UMJ, # and O(klU n) t ..."
Abstract - Cited by 36 (1 self) - Add to MetaCart
We introduce new type of context-free grammars, AVL-grammars, and show theirappl7#B#BZ87 to grammar-based compression. Using this type of grammars we present O(nl7 time and O(lZ n)-ratio approximation ofminimal grammar-based compression of a given string oflZM,k n over anal,UMJ, # and O(klU n) time transformation of LZ77 encoding of size k into a grammar-based encoding of size O(klU n).