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
Article Menu

Export Article

Open AccessArticle
Algorithms 2009, 2(4), 1429-1448; doi:10.3390/a2041429

Linear-Time Text Compression by Longest-First Substitution

Department of Informatics, Kyushu University, 744 Motooka, Fukuoka 819-0395, Japan
Graduate School of Information Science and Electrical Engineering, Kyushu University, 744 Motooka, Fukuoka 819-0395, Japan
Graduate School of Information Sciences, Tohoku University, Aoba 6-6-05, Aramaki, Sendai 980-8579, Japan
Author to whom correspondence should be addressed.
Received: 30 September 2009 / Accepted: 20 November 2009 / Published: 25 November 2009
(This article belongs to the Special Issue Data Compression)
View Full-Text   |   Download PDF [267 KB, uploaded 26 November 2009]   |  


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

Figure 1

This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

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

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top