Presentation 2004-09-17
A Space-Saving Linear-Time Algorithm for Grammar-Based Compression
Takuya KIDA, Hiroshi SAKAMOTO, Shinichi SHIMOZONO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A space-efficient linear-time approximation algorithm for the grammar-based compression problem, which requests for a given string to find a smallest context-free grammar deriving the string, is presented. The algorithm consumes only O(g_* log g_*) space and achieves the worst-case approximation ratio O(log g_* log n), with the size n of an input and the optimum grammar size g_*. Experimental results for typical benchmarks demonstrate that our algorithm is practical and efficient.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) dictionary-based compression / linear-time algorithm / approximation complexity
Paper # COMP2004-26
Date of Issue

Conference Information
Committee COMP
Conference Date 2004/9/10(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Space-Saving Linear-Time Algorithm for Grammar-Based Compression
Sub Title (in English)
Keyword(1) dictionary-based compression
Keyword(2) linear-time algorithm
Keyword(3) approximation complexity
1st Author's Name Takuya KIDA
1st Author's Affiliation Hokkaido University()
2nd Author's Name Hiroshi SAKAMOTO
2nd Author's Affiliation Kyushu Institute of Technology
3rd Author's Name Shinichi SHIMOZONO
3rd Author's Affiliation Kyushu Institute of Technology
Date 2004-09-17
Paper # COMP2004-26
Volume (vol) vol.104
Number (no) 317
Page pp.pp.-
#Pages 7
Date of Issue