Abstract
A linear-time approximation algorithm for the grammar-based compression, which is an optimization problem to minimize the size of a context-free grammar deriving a given string, is presented. For each string of length n over unbounded alphabet, the algorithm guarantees O(log2 n) approximation ratio without suffix tree and runs in O(n) time in the sense of randomized model. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Sakamoto, H. (2003). A fully linear-time approximation algorithm for grammar-based compression. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2676, 348–360. https://doi.org/10.1007/3-540-44888-8_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
