Linear-time off-line text compression by longest-first substitution

Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara

研究成果: Chapter in Book/Report/Conference proceedingChapter

7 被引用数 (Scopus)

抄録

Given a text, grammar-based compression is to construct a grammar that generates the text. There are many kinds of text compression techniques of this type. Each compression scheme is categorized as being either off-line or on-line, according to how a text is processed. One representative tactics for off-line compression is to substitute the longest repeated factors of a text with a production rule. In this paper, we present an algorithm that compresses a text basing on this longest-first principle, in linear time. The algorithm employs a suitable index structure for a text, and involves technically efficient operations on the structure.

本文言語英語
ホスト出版物のタイトルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
編集者Mario A. Nascimento, Edleno S. de Moura, Arlindo L. Oliveira
出版社Springer Verlag
ページ137-152
ページ数16
ISBN(印刷版)3540201777, 9783540201779
DOI
出版ステータス出版済み - 2003

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2857
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Linear-time off-line text compression by longest-first substitution」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル