An online algorithm for lightweight grammar-based compression

Shirou Maruyama, Hiroshi Sakamoto, Masayuki Takeda

研究成果: Contribution to journalArticle査読

22 被引用数 (Scopus)

抄録

Grammar-based compression is a well-studied technique to construct a context-free grammar (CFG) deriving a given text uniquely. In this work, we propose an online algorithm for grammar-based compression. Our algorithm guarantees O(log2 n)-approximation ratio for the minimum grammar size, where n is an input size, and it runs in input linear time and output linear space. In addition, we propose a practical encoding, which transforms a restricted CFG into a more compact representation. Experimental results by comparison with standard compressors demonstrate that our algorithm is especially effective for highly repetitive text.

本文言語英語
ページ(範囲)214-235
ページ数22
ジャーナルAlgorithms
5
2
DOI
出版ステータス出版済み - 6 2012

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • 数値解析
  • 計算理論と計算数学
  • 計算数学

フィンガープリント

「An online algorithm for lightweight grammar-based compression」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル