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

基于非交叉LCE算法的一般字母表上的近似最优计算

Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries

Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń

摘要:

最长公共扩展查询(LCE查询)和运行在算法字符串学中无处不在。线性时间算法计算运行和预处理恒定时间LCE查询已经知道了十多年。然而,这些算法假设线性可排序的整数字母表。Bannai et.最近的一篇突破性论文。al. (SODA 2015)展示了这两个概念之间的联系:字符串中的所有运行都可以通过线性数量的LCE查询来计算。Kosolobov(\emph{Inf.\ Process.\ Lett.},2016)是第一个在一般有序字母表上考虑这些问题的人,他提出了一种用于回答$O(n)$ LCE查询的$O(n (\log n)^{2/3})$时间算法。Gawrychowski等人改进了这一结果。al.(CPM 2016接受)到$O(n \log \log n)$时间。在这项工作中,我们注意到一个特殊的\emph{non-crossing}属性的LCE查询要求在运行计算。我们发现,任何$n$这样的非交叉查询可以回答在线$O(n α(n))$的时间,这产生了一个$O(n α(n))$时间算法计算运行。

英文摘要:

Longest common extension queries (LCE queries) and runs are ubiquitous in algorithmic stringology. Linear-time algorithms computing runs and preprocessing for constant-time LCE queries have been known for over a decade. However, these algorithms assume a linearly-sortable integer alphabet. A recent breakthrough paper by Bannai et.\ al.\ (SODA 2015) showed a link between the two notions: all the runs in a string can be computed via a linear number of LCE queries. The first to consider these problems over a general ordered alphabet was Kosolobov (\emph{Inf.\ Process.\ Lett.}, 2016), who presented an $O(n (\log n)^{2/3})$-time algorithm for answering $O(n)$ LCE queries. This result was improved by Gawrychowski et.\ al.\ (accepted to CPM 2016) to $O(n \log \log n)$ time. In this work we note a special \emph{non-crossing} property of LCE queries asked in the runs computation. We show that any $n$ such non-crossing queries can be answered on-line in $O(n α(n))$ time, which yields an $O(n α(n))$-time algorithm for computing runs.

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

↑