Skip to main content
Conference Proceedings

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2373 20-31
DOI: 10.1007/3-540-45452-7_3
10Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present almost linear time (O(n · log |Σ|) time) O(logn)-ratio approximation of minimal grammar-based compression of a given stringof length n over an alphabet Σ and O(k · log n) time transformation of LZ77 encodingof size k into a grammar-based encoding of size O(k · log n). Computingexact size of the minimal grammar-based compression is known to be NP-complete. The basic novel tool is the AVL-grammar.

Author supplied keywords

Cite

CITATION STYLE

APA

Rytter, W. (2002). Application of Lempel-Ziv factorization to the approximation of grammar-based compression. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2373, pp. 20–31). Springer Verlag. https://doi.org/10.1007/3-540-45452-7_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free