Name
Abstract | ||
|---|---|---|
Mauer et al. [A Lempel-Ziv-style Compression Method for Repetitive Texts, PSC 2017] proposed a hybrid text compression method called LZ-LFS which has both features of Lempel-Ziv 77 factorization and longest first substitution. They showed that LZ-LFS can achieve better compression ratio for repetitive texts, compared to some state-of-the-art compression algorithms. The drawback of Mauer et al.u0027s method is that their LZ-LFS compression algorithm takes $O(n^2)$ time on an input string of length $n$. In this paper, we show a faster LZ-LFS compression algorithm that works in $O(n log n)$ time. We also propose a simpler version of LZ-LFS that can be computed in $O(n)$ time. |
Year | Venue | Field |
|---|---|---|
2018 | Stringology | Compression (physics),Binary logarithm,Discrete mathematics,Combinatorics,Text compression,Compression ratio,Factorization,Data compression,Time complexity,Mathematics |
DocType | Volume | Citations |
Journal | abs/1806.04890 | 0 |
PageRank | References | Authors |
0.34 | 1 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akihiro Nishi | 1 | 0 | 0.34 |
| Yuto Nakashima | 2 | 57 | 19.52 |
| Shunsuke Inenaga | 3 | 595 | 79.02 |
| Hideo Bannai | 4 | 620 | 79.87 |
| Masayuki Takeda | 5 | 9 | 13.78 |