Highly Influenced

# Linear-Time Text Compression by Longest-First Substitution

@article{Nakamura2009LinearTimeTC, title={Linear-Time Text Compression by Longest-First Substitution}, author={Ryosuke Nakamura and Shunsuke Inenaga and Hideo Bannai and Takashi Funamoto and Masayuki Takeda and Ayumi Shinohara}, journal={Algorithms}, year={2009}, volume={2}, pages={1429-1448} }

- Published 2009 in Algorithms
DOI:10.3390/a2041429

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.