首页> 外文期刊>The Journal of Supercomputing >Exploiting parallelism on progressive alignment methods
【24h】

Exploiting parallelism on progressive alignment methods

机译:在渐进式对齐方法上利用并行性

获取原文
获取原文并翻译 | 示例

摘要

Multiple Sequence Alignment (MSA) constitutes an extremely powerful tool for important biological applications such as phylogenetic analysis, identification of conserved motifs and domains and structure prediction. In spite of the improvement in speed and accuracy introduced by MSA programs, the computational requirements for large-scale alignments requires high-performance computing and parallel applications. In this paper we present an improvement to a parallel implementation of T-Coffee, a widely used MSA package. Our approximation resolves the bottleneck of the progressive alignment stage on MSA. This is achieved by increasing the degree of parallelism by balancing the guide tree that drives the progressive alignment process. The experimental results show improvements in execution time of over 68% while maintaining the biological accuracy.
机译:多序列比对(MSA)为重要的生物学应用(例如系统发育分析,保守基序和结构域的识别以及结构预测)提供了极为强大的工具。尽管MSA程序引入了速度和准确性的提高,但大规模比对的计算要求仍需要高性能的计算和并行应用程序。在本文中,我们提出了对T-Coffee(一种广泛使用的MSA软件包)的并行实现的改进。我们的近似解决了MSA上渐进式校准阶段的瓶颈。这可以通过平衡驱动渐进式对齐过程的引导树来提高并行度来实现。实验结果表明,在保持生物学准确性的同时,执行时间缩短了68%以上。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号