arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.14385cs.DS
收藏

字符串反转对重复性度量的敏感性

Sensitivity of Repetitiveness Measures to String Reversal

Institute of Science Tokyo(东京科学大学);Kyushu University(九州大学);University of Helsinki(赫尔辛基大学);University of Warsaw(华沙大学)

Hideo Bannai, Yuto Fujie, Peaker Guo, Shunsuke Inenaga, Yuto Nakashima, Simon J. Puglisi, Cristian Urbina

AI总结:

研究揭示字符串反转对重复性度量如BWT运行数、LZ解析大小等的敏感性,发现其加性敏感性可达$Θ(n)$,并提出相关下界及变体分析。

摘要:

我们研究了字符串反转对几种重复性度量的影响。首先,我们展示了一族无限字符串,其中在Burrows-Wheeler变换(BWT)的run-length编码中,运行数$r$在反转字符串时可以增加$Θ(n)$。这显著改进了$r$的加性敏感性的已知下界$Ω(\log n)$,并且是渐近紧致的。我们将结果推广到其他BWT变体,包括带有附加结束符的变体和双射BWT。我们证明对于文本的Lempel-Ziv 77(LZ)解析的大小$z$,以及其某些变体,如非重叠LZ解析和LZ-end解析,也存在类似的结果。此外,我们描述了一族字符串,其中$z(w^R)/z(w)$随着$|w|→∞$时从下方趋近于3。我们还展示了最小字典序解析大小$v$对字符串反转的加性敏感性的渐近紧致下界$Θ(n)$。最后,我们证明$v$对字符串反转的乘法敏感性为$Θ(\log n)$,并且这个下界也是紧致的。总体而言,我们的结果揭示了在实践中广泛使用的重复性度量在面对字符串反转——一种简单且自然的数据转换时的局限性。

英文摘要:

We study the impact that string reversal can have on several repetitiveness measures. First, we exhibit an infinite family of strings where the number, $r$, of runs in the run-length encoding of the Burrows--Wheeler transform (BWT) can increase additively by $Θ(n)$ when reversing the string. This substantially improves the known $Ω(\log n)$ lower-bound for the additive sensitivity of $r$ and it is asymptotically tight. We generalize our result to other variants of the BWT, including the variant with an appended end-of-string symbol and the bijective BWT. We show that an analogous result holds for the size $z$ of the Lempel--Ziv 77 (LZ) parsing of the text, and also for some of its variants, including the non-overlapping LZ parsing, and the LZ-end parsing. Moreover, we describe a family of strings for which the ratio $z(w^R)/z(w)$ approaches $3$ from below as $|w|\rightarrow \infty$. We also show an asymptotically tight lower-bound of $Θ(n)$ for the additive sensitivity of the size $v$ of the smallest lexicographic parsing to string reversal. Finally, we show that the multiplicative sensitivity of $v$ to reversing the string is $Θ(\log n)$, and this lower-bound is also tight. Overall, our results expose the limitations of repetitiveness measures that are widely used in practice, against string reversal -- a simple and natural data transformation.

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

↑