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

交替的BWT:算法透视

The Alternating BWT: an algorithmic perspective

Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo, Giovanna Rosone, Marinella Sciortino

摘要:

Burrows-Wheeler变换(BWT)是1994年为数据压缩引入的一种字变换。它已成为设计自索引数据结构的基本工具,在科学和工程的许多领域有着重要的应用。交替Burrows-Wheeler变换(ABWT)是最近在[Gessel et al. 2012]中引入的另一种变换,并在单词组合学领域进行了研究。它类似于BWT,除了它使用交替的字典顺序而不是通常的顺序。基于[Giancarlo et al. 2018]中的结果,我们已经证明BWT和ABWT是更大一类可逆变换的一部分,在这里我们提供了新变换ABWT的组合和算法研究。我们建立了一个深刻的类比BWT和ABWT证明他们是唯一的在上述类是秩可逆的,一个新的概念,保证有效的可逆性。此外,我们表明,向后搜索过程可以有效地推广到ABWT,这一结果意味着ABWT也可以作为一个基础,高效的压缩全文索引。最后,我们证明了ABWT可以通过使用差分覆盖后缀排序算法的组合来有效地计算[Kärkkäinen等人,2006]与线性时间算法,用于找到一个词的最小循环旋转相对于交替字典顺序。

英文摘要:

The Burrows-Wheeler Transform (BWT) is a word transformation introduced in 1994 for Data Compression. It has become a fundamental tool for designing self-indexing data structures, with important applications in several area in science and engineering. The Alternating Burrows-Wheeler Transform (ABWT) is another transformation recently introduced in [Gessel et al. 2012] and studied in the field of Combinatorics on Words. It is analogous to the BWT, except that it uses an alternating lexicographical order instead of the usual one. Building on results in [Giancarlo et al. 2018], where we have shown that BWT and ABWT are part of a larger class of reversible transformations, here we provide a combinatorial and algorithmic study of the novel transform ABWT. We establish a deep analogy between BWT and ABWT by proving they are the only ones in the above mentioned class to be rank-invertible, a novel notion guaranteeing efficient invertibility. In addition, we show that the backward-search procedure can be efficiently generalized to the ABWT; this result implies that also the ABWT can be used as a basis for efficient compressed full text indices. Finally, we prove that the ABWT can be efficiently computed by using a combination of the Difference Cover suffix sorting algorithm [Kärkkäinen et al., 2006] with a linear time algorithm for finding the minimal cyclic rotation of a word with respect to the alternating lexicographical order.

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

↑