首页> 外文会议>International Workshop on Algorithms in Bioinformatics(WABI 2006); 20060911-13; Zurich(CH) >Accelerating Motif Discovery: Motif Matching on Parallel Hardware
【24h】

Accelerating Motif Discovery: Motif Matching on Parallel Hardware

机译:加速Motif发现:并行硬件上的Motif匹配

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

摘要

Discovery of motifs in biological sequences is an important problem, and several computational methods have been developed to date. One of the main limitations of the established motif discovery methods is that the running time is prohibitive for very large data sets, such as upstream regions of large sets of cell-cycle regulated genes. Parallel versions have been developed for some of these methods, but this requires supercomputers or large computer clusters. Here, we propose and define an abstract module PAMM (Parallel Acceleration of Motif Matching) with motif matching on parallel hardware in mind. As a proof-of-concept, we provide a concrete implementation of our approach called MAMA. The implementation is based on the MEME algorithm, and uses an implementation of PAMM based on specialized hardware to accelerate motif matching. Running MAMA on a standard PC with specialized hardware on a single PCI-card compares favorably to running parallel MEME on a cluster of 12 computers.
机译:在生物序列中发现基序是一个重要的问题,迄今为止已经开发了几种计算方法。已建立的基序发现方法的主要限制之一是运行时间对于非常大的数据集(例如,大量细胞周期调控基因的上游区域)是禁止的。已经为其中一些方法开发了并行版本,但这需要超级计算机或大型计算机集群。在这里,我们提出并定义了一个抽象模块PAMM(主题匹配的并行加速),其中考虑了并行硬件上的主题匹配。作为概念验证,我们提供了称为MAMA的方法的具体实现。该实现基于MEME算法,并使用基于专用硬件的PAMM的实现来加速主题匹配。与在12台计算机的群集上运行并行MEME相比,在标准PC上运行MAMA且在单个PCI卡上具有专用硬件的情况更好。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号