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

在近线性时间内近似编辑距离

Approximating Edit Distance in Near-Linear Time

Alexandr Andoni, Krzysztof Onak

摘要:

我们展示了如何在n^(1+o(1))时间内计算两个长度为n的字符串之间的编辑距离,最大为2^{sqrt(log n))}。这是该问题的第一个子多项式近似算法,在近线性时间内运行,改进了最先进的n^(1/3+o(1))近似。以前,2^{sqrt(log n))}的近似仅用于将编辑距离嵌入到l_1中,并且不知道该嵌入是否可以在小于二次时间内计算。

英文摘要:

We show how to compute the edit distance between two strings of length n up to a factor of 2^{Õ(sqrt(log n))} in n^(1+o(1)) time. This is the first sub-polynomial approximation algorithm for this problem that runs in near-linear time, improving on the state-of-the-art n^(1/3+o(1)) approximation. Previously, approximation of 2^{Õ(sqrt(log n))} was known only for embedding edit distance into l_1, and it is not known if that embedding can be computed in less than quadratic time.

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

↑