arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1611.01769cs.DS
收藏

压缩空间中的LZ-结束分析

LZ-End Parsing in Compressed Space

Dominik Kempa, Dmitry Kosolobov

摘要:

我们提出了一个算法,构造的LZ-结束分析(LZ 77的变化)的一个给定的字符串的长度$n$在$O(n\log\ell)$预期的时间和$O(z + \ell)$空间,其中$z$是在分析和$\ell$是最长的短语的长度。作为一种选择,我们可以修复$\ell$(例如,到RAM的大小),从而获得具有相同功能和由$\ell$限制的短语长度的合理的LZ端近似。该改进的算法以流的方式对输入字符串w. h. p.进行一次从左到右的解析,并执行一次从右到左的解析以验证结果的正确性。通过实验比较这个版本与其他基于LZ 77的类似物,我们表明它具有实际意义。

英文摘要:

We present an algorithm that constructs the LZ-End parsing (a variation of LZ77) of a given string of length $n$ in $O(n\log\ell)$ expected time and $O(z + \ell)$ space, where $z$ is the number of phrases in the parsing and $\ell$ is the length of the longest phrase. As an option, we can fix $\ell$ (e.g., to the size of RAM) thus obtaining a reasonable LZ-End approximation with the same functionality and the length of phrases restricted by $\ell$. This modified algorithm constructs the parsing in streaming fashion in one left to right pass on the input string w.h.p. and performs one right to left pass to verify the correctness of the result. Experimentally comparing this version to other LZ77-based analogs, we show that it is of practical interest.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑