arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.01173cs.DScs.DM
收藏

关于LZ-End对LZ77的逼近比

On the approximation ratio of LZ-End to LZ77

Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda

摘要:

Lempel-Ziv分解族是一个研究得很好的弦结构。LZ-End因式分解是家族中的一员,可以更快地提取任何子串(Kreft & Navarro,TCS 2013)。LZ-End因子分解的一个兴趣是LZ-End和LZ 77因子分解的大小之间可能存在差异。他们还展示了LZ-End短语数量与LZ 77短语数量的近似比率渐近接近2的字符串家族。然而,这些字符串的字母大小是无限的。本文分析了倍周期序列的LZ-End分解。我们还表明,倍周期序列的逼近比渐近接近2的二进制字母表。

英文摘要:

A family of Lempel-Ziv factorizations is a well-studied string structure. The LZ-End factorization is a member of the family that achieved faster extraction of any substrings (Kreft & Navarro, TCS 2013). One of the interests for LZ-End factorizations is the possible difference between the size of LZ-End and LZ77 factorizations. They also showed families of strings where the approximation ratio of the number of LZ-End phrases to the number of LZ77 phrases asymptotically approaches 2. However, the alphabet size of these strings is unbounded. In this paper, we analyze the LZ-End factorization of the period-doubling sequence. We also show that the approximation ratio for the period-doubling sequence asymptotically approaches 2 for the binary alphabet.

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

↑