基于LZ型最长优先替换的$O(n \log n)$时间文本压缩
$O(n \log n)$-time text compression by LZ-style longest first substitution
摘要：
Mauer等人[A Lempel-Ziv-style Compression Method for Repetitive Texts，PSC 2017]提出了一种混合文本压缩方法，称为LZ-LFS，它具有Lempel-Ziv 77因子分解和最长第一替换的特性。他们表明，与一些最先进的压缩算法相比，LZ-LFS可以对重复文本实现更好的压缩率。Mauer et al.的方法是，他们的LZ-LFS压缩算法在长度为$n$的输入字符串上花费$O(n^2)$时间。在本文中，我们展示了一个更快的LZ-LFS压缩算法，工作在$O(n \log n)$时间。我们还提出了一个更简单的版本的LZ-LFS，可以计算在$O(n)$时间。
英文摘要：
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.'s 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
