Linear-Time Text Compression by Longest-First Substitution

Linear-Time Text Compression by Longest-First Substitution

We consider grammar-based text compression with longest first substitution (LFS), where non-overlapping occurrences of a longest repeating factor of the input text are replaced by a new non-terminal symbol. We present the first linear-time algorithm for LFS. Our algorithm employs a new data structur...

Full description

Bibliographic Details
Main Authors: Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Takashi Funamoto, Ryosuke Nakamura, Shunsuke Inenaga
Format: Article
Language:English
Published: MDPI AG 2009-11-01
Series:Algorithms
Subjects:
grammar-based text compression
suffix trees
linear-time algorithms
Online Access:http://www.mdpi.com/1999-4893/2/4/1429/
Description
Summary:We consider grammar-based text compression with longest first substitution (LFS), where non-overlapping occurrences of a longest repeating factor of the input text are replaced by a new non-terminal symbol. We present the first linear-time algorithm for LFS. Our algorithm employs a new data structure called sparse lazy suffix trees. We also deal with a more sophisticated version of LFS, called LFS2, that allows better compression. The first linear-time algorithm for LFS2 is also presented.
ISSN:1999-4893

Similar Items