Sciweavers

DCC
2007
IEEE
15 years 1 days ago
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, ...