探索二维字符串的重复性度量
Exploring Repetitiveness Measures for Two-Dimensional Strings
AI总结:
本文研究二维字符串的重复性度量,提出 δ 与 γ 的新扩展及二维宏方案和 SLP 的推广,证明二者均可渐近小于这两个度量。
摘要:
检测和度量字符串的重复性是数据压缩与文本索引中已被广泛研究的问题。然而,当数据以非线性方式组织时,例如在二维字符串的情境中,其内在冗余为压缩提供了丰富来源,但关于重复性度量的系统性研究仍然缺乏。在本文中,我们将重复性度量扩展到一般二维字符串。特别地,我们提出了度量 δ 和 γ 的一种新扩展,不同于 [Carfagna and Manzini, SPIRE 2023] 中先前提出的基于正方形的定义。我们还进一步考虑了二维设置下宏方案和直线程序的推广,并表明:与一维字符串上的情况不同,二维宏方案和二维 SLP 在渐近意义下都可以小于 δ 和 γ。本文的结果可以很容易地扩展到 d > 2 的 d 维字符串。
英文摘要:
Detecting and measuring repetitiveness of strings is a problem that has been extensively studied in data compression and text indexing. However, when the data are structured in a non-linear way, like in the context of two-dimensional strings, inherent redundancy offers a rich source for compression, yet systematic studies on repetitiveness measures are still lacking. In the paper we introduce extensions of repetitiveness measures to general two-dimensional strings. In particular, we propose a new extension of the measures $δ$ and $γ$, diverging from previous square based definitions proposed in [Carfagna and Manzini, SPIRE 2023]. We further consider generalizations of macro schemes and straight line programs for the 2D setting and show that, in contrast to what happens on strings, 2D macro schemes and 2D SLPs can be both asymptotically smaller than $δ$ and $γ$. The results of the paper can be easily extended to $d$-dimensional strings with $d > 2$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。