Sample-Align-D:一个基于系统发生抽样和区域分解的高性能多序列比对系统
Sample-Align-D: A High Performance Multiple Sequence Alignment System using Phylogenetic Sampling and Domain Decomposition
摘要:
多序列比对是计算生物学中计算量最大的任务之一。用于多序列比对的现有最佳已知解决方案花费数小时(在某些情况下为数天)的计算时间来比对例如平均长度为300的2000个同源序列。受并行处理中的样本排序方法的启发,本文提出了一种高度可扩展的多处理器解决方案,用于遗传多样性序列中的MSA问题。我们的方法采用了一个智能的计划,使用kmer计数为基础的相似性指数,称为k-mer秩的序列集划分成更小的子集。然后使用任何顺序方法独立并行对齐每个子集。使用从整个集合的全局祖先导出的约束来实现局部对准的进一步微调。提出的Sample-Align-D算法已在一个工作站集群上使用MPI消息传递库实现。所提出的解决方案的准确性已在标准基准测试,如PREFAB。由我们的方法产生的对齐的准确性是众所周知的顺序MSA技术相媲美。我们能够在16个节点的集群上使用Sample-Align-D在不到10分钟的时间内从Methanosarcina acetivorans基因组中比对2000个随机选择的序列,而在单个集群节点上运行的顺序MUSCLE系统超过23小时。
英文摘要:
Multiple Sequence Alignment (MSA) is one of the most computationally intensive tasks in Computational Biology. Existing best known solutions for multiple sequence alignment take several hours (in some cases days) of computation time to align, for example, 2000 homologous sequences of average length 300. Inspired by the Sample Sort approach in parallel processing, in this paper we propose a highly scalable multiprocessor solution for the MSA problem in phylogenetically diverse sequences. Our method employs an intelligent scheme to partition the set of sequences into smaller subsets using kmer count based similarity index, referred to as k-mer rank. Each subset is then independently aligned in parallel using any sequential approach. Further fine tuning of the local alignments is achieved using constraints derived from a global ancestor of the entire set. The proposed Sample-Align-D Algorithm has been implemented on a cluster of workstations using MPI message passing library. The accuracy of the proposed solution has been tested on standard benchmarks such as PREFAB. The accuracy of the alignment produced by our methods is comparable to that of well known sequential MSA techniques. We were able to align 2000 randomly selected sequences from the Methanosarcina acetivorans genome in less than 10 minutes using Sample-Align-D on a 16 node cluster, compared to over 23 hours on sequential MUSCLE system running on a single cluster node.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。