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

Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara

研究成果: ジャーナルへの寄稿記事

6 引用 (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.

元の言語英語
ページ(範囲)137-152
ページ数16
ジャーナルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2857
出版物ステータス出版済み - 12 1 2003

Fingerprint

Text Compression
Substitution
Linear Time
Substitution reactions
Line
Compression
Grammar
Production Rules
First-principles
Substitute
Text

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

@article{d44852bb146745d0ab7151f0899eff9e,
title = "Linear-time off-line text compression by longest-first substitution",
abstract = "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.",
author = "Shunsuke Inenaga and Takashi Funamoto and Masayuki Takeda and Ayumi Shinohara",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2857",
pages = "137--152",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

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

AU - Inenaga, Shunsuke

AU - Funamoto, Takashi

AU - Takeda, Masayuki

AU - Shinohara, Ayumi

PY - 2003/12/1

Y1 - 2003/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0142218944&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0142218944&partnerID=8YFLogxK

M3 - Article

VL - 2857

SP - 137

EP - 152

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -