Next Article in Journal
Exact and Heuristic Algorithms for Thrift Cyclic Scheduling
Next Article in Special Issue
Interactive Compression of Digital Data
Previous Article in Journal
A Framework for Bioacoustic Vocalization Analysis Using Hidden Markov Models
Previous Article in Special Issue
Multiplication Symmetric Convolution Property for Discrete Trigonometric Transforms
Open AccessArticle

Linear-Time Text Compression by Longest-First Substitution

1
Department of Informatics, Kyushu University, 744 Motooka, Fukuoka 819-0395, Japan
2
Graduate School of Information Science and Electrical Engineering, Kyushu University, 744 Motooka, Fukuoka 819-0395, Japan
3
Graduate School of Information Sciences, Tohoku University, Aoba 6-6-05, Aramaki, Sendai 980-8579, Japan
*
Author to whom correspondence should be addressed.
Algorithms 2009, 2(4), 1429-1448; https://doi.org/10.3390/a2041429
Received: 30 September 2009 / Accepted: 20 November 2009 / Published: 25 November 2009
(This article belongs to the Special Issue Data Compression)
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. View Full-Text
Keywords: grammar-based text compression; suffix trees; linear-time algorithms grammar-based text compression; suffix trees; linear-time algorithms
Show Figures

Figure 1

MDPI and ACS Style

Nakamura, R.; Inenaga, S.; Bannai, H.; Funamoto, T.; Takeda, M.; Shinohara, A. Linear-Time Text Compression by Longest-First Substitution. Algorithms 2009, 2, 1429-1448.

Show more citation formats Show less citations formats

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop