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

一种改进的多序列最优比对搜索算法

An Improved Search Algorithm for Optimal Multiple-Sequence Alignment

S. Schroedl

摘要:

多序列比对是计算生物学中普遍存在的问题。尽管对于任意数量的序列找到最优解是NP难的,但由于这个问题的重要性,研究人员正试图进一步推动精确算法的极限。由于MSA可以被看作是一个经典的路径寻找问题,它吸引了越来越多的人工智能研究人员感兴趣的启发式搜索算法作为一个具有实际意义的挑战。在本文中,我们首先回顾了两个以前的,互补的研究路线。基于Hirschbergs算法,动态规划需要O(kN^(k-1))空间来存储搜索前沿和重构解路径所需的节点,对于k个长度为N的序列。另一方面,最佳优先搜索具有限制必须使用启发式探索的搜索空间的优点。然而,有必要将所有探索的节点保持到最终解决方案,以防止搜索以更高的成本重新扩展它们。早期减少Closed列表的方法要么与Open列表的修剪方法不兼容,要么必须至少保留Closed列表的边界。在本文中,我们提出了一个算法,试图结合各自的优点;像A* 一样,它使用启发式来修剪搜索空间,但将最大开和闭大小都减少到O(kN^(k-1)),就像动态规划一样。其基本思想是进行一系列的搜索,不断增加的上限,但使用DP排序作为关键的开放优先级队列。在适当选择阈值的情况下,实际上,可以预期运行时间低于A* 的四倍。在我们的实验中,我们表明,我们的算法优于目前最成功的算法之一,最佳的多序列比对,部分扩展A*,在时间和内存。此外,我们应用一个完善的启发式的基础上,不仅对序列的最佳比对,但更大的子集。这个想法并不新鲜;然而,为了使它实际上相关,我们表明,它是同样重要的启发式计算适当地绑定,或开销可以抹杀任何可能的增益。此外,我们讨论了一些改进的时间和空间效率方面的实际实现。我们的算法,结合使用更高的维度的几何学,是能够计算的第一次几乎所有的基准数据库BAliBASE的参考文献1中的问题的最佳对齐。

英文摘要:

Multiple sequence alignment (MSA) is a ubiquitous problem in computational biology. Although it is NP-hard to find an optimal solution for an arbitrary number of sequences, due to the importance of this problem researchers are trying to push the limits of exact algorithms further. Since MSA can be cast as a classical path finding problem, it is attracting a growing number of AI researchers interested in heuristic search algorithms as a challenge with actual practical relevance. In this paper, we first review two previous, complementary lines of research. Based on Hirschbergs algorithm, Dynamic Programming needs O(kN^(k-1)) space to store both the search frontier and the nodes needed to reconstruct the solution path, for k sequences of length N. Best first search, on the other hand, has the advantage of bounding the search space that has to be explored using a heuristic. However, it is necessary to maintain all explored nodes up to the final solution in order to prevent the search from re-expanding them at higher cost. Earlier approaches to reduce the Closed list are either incompatible with pruning methods for the Open list, or must retain at least the boundary of the Closed list. In this article, we present an algorithm that attempts at combining the respective advantages; like A* it uses a heuristic for pruning the search space, but reduces both the maximum Open and Closed size to O(kN^(k-1)), as in Dynamic Programming. The underlying idea is to conduct a series of searches with successively increasing upper bounds, but using the DP ordering as the key for the Open priority queue. With a suitable choice of thresholds, in practice, a running time below four times that of A* can be expected. In our experiments we show that our algorithm outperforms one of the currently most successful algorithms for optimal multiple sequence alignments, Partial Expansion A*, both in time and memory. Moreover, we apply a refined heuristic based on optimal alignments not only of pairs of sequences, but of larger subsets. This idea is not new; however, to make it practically relevant we show that it is equally important to bound the heuristic computation appropriately, or the overhead can obliterate any possible gain. Furthermore, we discuss a number of improvements in time and space efficiency with regard to practical implementations. Our algorithm, used in conjunction with higher-dimensional heuristics, is able to calculate for the first time the optimal alignment for almost all of the problems in Reference 1 of the benchmark database BAliBASE.

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

↑