多处理器平台上多生物序列比对的区域分解策略
A Domain Decomposition Strategy for Alignment of Multiple Biological Sequences on Multiprocessor Platforms
摘要:
生物序列的多序列比对(MSA)是计算生物学中的一个基本问题,它在单倍型重构、序列同源性分析、系统发育分析和进化起源预测等方面具有重要的应用价值。MSA问题被认为是NP-难的,并且已知的问题的算法不能随着序列数量的增加而很好地扩展。另一方面,随着新一代快速测序技术的出现,现在可以非常快速地生成数千个序列。对于快速序列分析,因此期望开发快速MSA算法,其随着数据集大小的增加而很好地扩展。在本文中,我们提出了一种新的区域分解为基础的技术来解决多处理平台上的MSA问题。基于域分解的技术,除了产生更好的质量,在执行时间和内存需求方面提供了巨大的优势。所提出的策略允许将任何已知的O(N)^x复杂度的启发式算法的时间复杂度降低O(1/p)^x,其中N是序列的数量,x取决于底层的启发式方法,p是处理节点的数量。特别是,我们提出了一个高度可扩展的算法,Sample-Align-D,用于使用肌肉系统作为底层启发式算法来对齐生物序列。所提出的算法已经实现了一个集群的工作站使用MPI库。不同规模的问题的实验结果进行了分析,在对齐的质量,执行时间和加速。
英文摘要:
Multiple Sequences Alignment (MSA) of biological sequences is a fundamental problem in computational biology due to its critical significance in wide ranging applications including haplotype reconstruction, sequence homology, phylogenetic analysis, and prediction of evolutionary origins. The MSA problem is considered NP-hard and known heuristics for the problem do not scale well with increasing number of sequences. On the other hand, with the advent of new breed of fast sequencing techniques it is now possible to generate thousands of sequences very quickly. For rapid sequence analysis, it is therefore desirable to develop fast MSA algorithms that scale well with the increase in the dataset size. In this paper, we present a novel domain decomposition based technique to solve the MSA problem on multiprocessing platforms. The domain decomposition based technique, in addition to yielding better quality, gives enormous advantage in terms of execution time and memory requirements. The proposed strategy allows to decrease the time complexity of any known heuristic of O(N)^x complexity by a factor of O(1/p)^x, where N is the number of sequences, x depends on the underlying heuristic approach, and p is the number of processing nodes. In particular, we propose a highly scalable algorithm, Sample-Align-D, for aligning biological sequences using Muscle system as the underlying heuristic. The proposed algorithm has been implemented on a cluster of workstations using MPI library. Experimental results for different problem sizes are analyzed in terms of quality of alignment, execution time and speed-up.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。