A fully linear-time approximation algorithm for grammar-based compression

Authors:
Hiroshi Sakamoto
Affiliations:
Department of Informatics, Kyushu University, Fukuoka, Japan
Venue:
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Year:
2003

Citing 14
Cited 0

On-line versus off-line computation in dynamic text compression

Information Processing Letters
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
Approximation algorithms for grammar-based compression

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Collage system: a unifying framework for compressed pattern matching

Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Optimal suffix tree construction with large alphabets

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The macro model for data compression (Extended Abstract)

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Approximation algorithms for grammar-based data compression

Approximation algorithms for grammar-based data compression
A Technique for High-Performance Data Compression

Computer
Grammar-based codes: a new class of universal lossless source codes

IEEE Transactions on Information Theory
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models

IEEE Transactions on Information Theory
Universal lossless compression via multilevel pattern matching

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.