arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.03040cs.DSq-bio.QM
收藏

Indel通道的近线性时间编辑距离

Near-Linear Time Edit Distance for Indel Channels

Arun Ganesh, Aaron Sy

摘要:

我们考虑下面的模型对字符串进行采样:$s_1$是长度为$n$的均匀随机位串,$s_2$是通过以一定概率对$s_1$的每个位应用替换、插入和删除而得到的位串。我们发现,$s_1$和$s_2$之间的编辑距离可以计算在$O(n \ln n)$时间具有很高的概率,只要每个位的$s_1$有一个突变应用到它的概率最多一个小常数。该算法简单,仅使用教科书中的动态规划算法作为原语,首先计算两个字符串之间的近似对齐,然后运行限制于接近近似对齐的条目的动态规划算法。我们的算法的分析提供了理论上的对齐算法在实践中使用,如BLAST,FASTA,和MAFFT,也开始通过计算近似比对快速,然后找到最佳的比对附近的近似比对。我们的主要技术贡献是一个分区的对齐,这样的分区中的子集的数量是不是太大,在一个子集中的每一个对齐是比我们的算法所考虑的对齐概率高。类似的技术可能是感兴趣的平均情况下分析的其他问题,通常通过动态规划解决。

英文摘要:

We consider the following model for sampling pairs of strings: $s_1$ is a uniformly random bitstring of length $n$, and $s_2$ is the bitstring arrived at by applying substitutions, insertions, and deletions to each bit of $s_1$ with some probability. We show that the edit distance between $s_1$ and $s_2$ can be computed in $O(n \ln n)$ time with high probability, as long as each bit of $s_1$ has a mutation applied to it with probability at most a small constant. The algorithm is simple and only uses the textbook dynamic programming algorithm as a primitive, first computing an approximate alignment between the two strings, and then running the dynamic programming algorithm restricted to entries close to the approximate alignment. The analysis of our algorithm provides theoretical justification for alignment heuristics used in practice such as BLAST, FASTA, and MAFFT, which also start by computing approximate alignments quickly and then find the best alignment near the approximate alignment. Our main technical contribution is a partitioning of alignments such that the number of the subsets in the partition is not too large and every alignment in one subset is worse than an alignment considered by our algorithm with high probability. Similar techniques may be of interest in the average-case analysis of other problems commonly solved via dynamic programming.

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

↑