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

平均情况最优近似圆串匹配

Average-Case Optimal Approximate Circular String Matching

Carl Barton, Costas S. Iliopoulos, Solon P. Pissis

摘要:

近似字符串匹配是找到长度为n的文本t的所有因子的问题,这些因子与长度为m的模式x的距离最多为k。近似圆串匹配是找到t的所有因子的问题,这些因子与x或其任何旋转的距离最多为k。在本文中,我们提出了一个新的近似圆形字符串匹配的编辑距离模型下的最佳平均情况下的搜索时间为O(n(k + log m)/m)的算法。最佳平均情况搜索时间也可以通过使用x及其旋转作为多个模式的集合的多个近似字符串匹配算法(Fredriksson和Navarro,2004)来实现。在这里,我们减少了预处理的时间和空间的要求相比,这种方法。

英文摘要:

Approximate string matching is the problem of finding all factors of a text t of length n that are at a distance at most k from a pattern x of length m. Approximate circular string matching is the problem of finding all factors of t that are at a distance at most k from x or from any of its rotations. In this article, we present a new algorithm for approximate circular string matching under the edit distance model with optimal average-case search time O(n(k + log m)/m). Optimal average-case search time can also be achieved by the algorithms for multiple approximate string matching (Fredriksson and Navarro, 2004) using x and its rotations as the set of multiple patterns. Here we reduce the preprocessing time and space requirements compared to that approach.

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

↑