首页> 外文期刊>International Journal of Computational Science and Engineering >Efficient parallel algorithm for multiple sequence alignments with regular expression constraints on graphics processing units
【24h】

Efficient parallel algorithm for multiple sequence alignments with regular expression constraints on graphics processing units

机译:用于图形处理单元上具有正则表达式约束的多序列比对的高效并行算法

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

摘要

Multiple sequence alignments with constraints has become an important problem in computational biology. The concept of constrained sequence alignment is proposed to incorporate the biologist's domain knowledge into sequence alignments such that the user-specified residues/segments are aligned together in the alignment results. Over the past decade, a series of constrained multiple sequence alignment tools were proposed in the literature. RE-MuSiC is the newest tool with the regular expression constraints and useful for a wide range of biological applications. However, the computation time of REMuSiC is large for a large amount of sequences or long sequences and this problem limits the application usage. Therefore, in this paper, a tool, GPU-REMuSiC v1.0, is proposed to reduce the computation time of RE-MuSiC by using the graphics processing units with CUDA. GPU-REMuSiC v1.0 can achieve 29× speedups for overall computation time by the experimental results.
机译:具有约束的多重序列比对已经成为计算生物学中的重要问题。提出了约束序列比对的概念,以将生物学家的领域知识整合到序列比对中,从而使用户指定的残基/片段在比对结果中比对在一起。在过去的十年中,文献中提出了一系列受限的多序列比对工具。 RE-MuSiC是具有正则表达式约束的最新工具,可用于多种生物学应用。但是,对于大量序列或长序列,REMuSiC的计算时间较长,并且此问题限制了应用程序的使用。因此,本文提出了一种使用GPU-REMuSiC v1.0的工具,通过使用带有CUDA的图形处理单元来减少RE-MuSiC的计算时间。根据实验结果,GPU-REMuSiC v1.0可以使整体计算时间提高29倍。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号