Off-line compression by greedy textual substitution

Apostolico, Alberto; Lonardi, Stefano

doi:10.1109/5.892709

Cited by 79 publications

(69 citation statements)

References 35 publications

(34 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It could be possible to extend our analysis to other compression methods that operate by textual substitution, see for example [1,16]. Some of those, however, are on-line (e.g.…”

Section: Discussionmentioning

confidence: 99%

Re-pair Achieves High-Order Entropy

Navarro

S.Russo

2008

Data Compression Conference (Dcc 2008)

View full text Add to dashboard Cite

Re-Pair is a dictionary-based compression method invented in 1999 by Larsson and Moffat. Although its practical performance has been established through experiments, the method has resisted all attempts of formal analysis. In this paper we show that Re-Pair compresses a sequence T [1, n] over an alphabet of size σ and k-th order entropy H k , to at most 2H k + o(n log σ) bits, for any k = o(log σ n).

show abstract

“…It could be possible to extend our analysis to other compression methods that operate by textual substitution, see for example [1,16]. Some of those, however, are on-line (e.g.…”

Section: Discussionmentioning

confidence: 99%

Re-pair Achieves High-Order Entropy

Navarro

S.Russo

2008

Data Compression Conference (Dcc 2008)

View full text Add to dashboard Cite

show abstract

“…For this reason, there exist many characteristic compression algorithms proposed so far. In the grammar-based compression, some algorithms based on greedy strategies are known to achieve high compression ratios for the real-world texts, e.g., SEQUITUR [18], RE-PAIR [19], GREEDY [20], LFS2 [21], etc. Their upper bound of approximation ratios were theoretically analyzed in [22].…”

Section: Introductionmentioning

confidence: 99%

An Online Algorithm for Lightweight Grammar-Based Compression

Maruyama

Takeda

Nakahara

et al. 2011

2011 First International Conference on Data Compression, Communications and Processing

View full text Add to dashboard Cite

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(log 2 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.

show abstract

“…Kieffer and Yang proposed to replace longest matching substring [11]. Apostolico and Lonardi [3] proposed in their algorithm Off-Line to choose the substring yielding the best compression in a steepest-descent fashion. Efficient implementation of an elaborate choice of repeat often requires to use data structures from the suffix tree family.…”

Section: Motivationmentioning

confidence: 99%

In-Place Update of Suffix Array While Recoding Words

Gallé

Peterlongo

Coste

2009

Int. J. Found. Comput. Sci.

View full text Add to dashboard Cite

Motivated by grammatical inference and data compression applications, we propose an algorithm to update a suffix array while in the indexed text some occurrences of a given word are substituted by a new character. Compared to other published index update methods, the problem addressed here may require the modification of a large number of distinct positions over the original text. The proposed algorithm uses the specific internal order of suffix arrays in order to update simultaneously groups of indices, and ensures that only indices to be modified are visited. Experiments confirm a significant execution time speedup compared to the construction of suffix array from scratch at each step of the application.

show abstract

Off-line compression by greedy textual substitution

Cited by 79 publications

References 35 publications

Re-pair Achieves High-Order Entropy

Re-pair Achieves High-Order Entropy

An Online Algorithm for Lightweight Grammar-Based Compression

In-Place Update of Suffix Array While Recoding Words

Contact Info

Product

Resources

About