ApHMM:加速Profile Hidden Markov Models以实现快速且节能的基因组分析
ApHMM: Accelerating Profile Hidden Markov Models for Fast and Energy-Efficient Genome Analysis
AI总结:
ApHMM是首个针对pHMMs中Baum-Welch算法的灵活HW/SW协同设计加速框架,通过灵活硬件、片上记忆化、硬件过滤和减少冗余计算,在三大生物信息学应用中实现了最高260.03倍加速与115.46倍能效提升。
摘要:
Profile hidden Markov models (pHMMs) 被广泛应用于各种生物信息学应用中,以识别生物序列(如DNA或蛋白质序列)之间的相似性。在pHMMs中,序列被表示为图结构。这些概率随后被用于计算序列与pHMM图之间的相似度得分。Baum-Welch算法是一种流行且高精度的方法,利用这些概率来优化并计算相似度得分。然而,Baum-Welch算法计算量庞大,且现有解决方案仅提供固定pHMM设计的纯软件或纯硬件方法。我们发现,迫切需要一种灵活、高性能且节能的HW/SW协同设计,以解决pHMMs的Baum-Welch算法中的主要低效问题。\n我们引入了ApHMM,这是首个灵活的加速框架,旨在显著降低与pHMMs的Baum-Welch算法相关的计算和能耗开销。ApHMM通过以下方式解决Baum-Welch算法中的主要低效问题:1) 设计灵活的硬件以适应各种pHMM设计,2) 通过片上存储和记忆化技术利用可预测的数据依赖模式,3) 使用基于硬件的过滤器快速滤除可忽略的计算,以及4) 最小化冗余计算。\n与分别在CPU、GPU和FPGA上实现的Baum-Welch算法相比,ApHMM实现了15.55倍 - 260.03倍、1.83倍 - 5.34倍和27.97倍的显著加速。在三个关键生物信息学应用中:1) 纠错、2) 蛋白质家族搜索和3) 多序列比对,ApHMM分别以1.29倍 - 59.94倍、1.03倍 - 1.75倍和1.03倍 - 1.95倍的优势优于最先进的CPU实现,同时将其能效提升了64.24倍 - 115.46倍、1.75倍和1.96倍。
英文摘要:
Profile hidden Markov models (pHMMs) are widely employed in various bioinformatics applications to identify similarities between biological sequences, such as DNA or protein sequences. In pHMMs, sequences are represented as graph structures. These probabilities are subsequently used to compute the similarity score between a sequence and a pHMM graph. The Baum-Welch algorithm, a prevalent and highly accurate method, utilizes these probabilities to optimize and compute similarity scores. However, the Baum-Welch algorithm is computationally intensive, and existing solutions offer either software-only or hardware-only approaches with fixed pHMM designs. We identify an urgent need for a flexible, high-performance, and energy-efficient HW/SW co-design to address the major inefficiencies in the Baum-Welch algorithm for pHMMs. We introduce ApHMM, the first flexible acceleration framework designed to significantly reduce both computational and energy overheads associated with the Baum-Welch algorithm for pHMMs. ApHMM tackles the major inefficiencies in the Baum-Welch algorithm by 1) designing flexible hardware to accommodate various pHMM designs, 2) exploiting predictable data dependency patterns through on-chip memory with memoization techniques, 3) rapidly filtering out negligible computations using a hardware-based filter, and 4) minimizing redundant computations. ApHMM achieves substantial speedups of 15.55x - 260.03x, 1.83x - 5.34x, and 27.97x when compared to CPU, GPU, and FPGA implementations of the Baum-Welch algorithm, respectively. ApHMM outperforms state-of-the-art CPU implementations in three key bioinformatics applications: 1) error correction, 2) protein family search, and 3) multiple sequence alignment, by 1.29x - 59.94x, 1.03x - 1.75x, and 1.03x - 1.95x, respectively, while improving their energy efficiency by 64.24x - 115.46x, 1.75x, 1.96x.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。