Demo Data from EDBT 2026 / reviewers in the wild / expert
Bharathwaj Suresh
dblp:257/5213
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0003-6703-7668ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Hardware accelerators and domain-specific architectures · 77% Electronic design automation · 23% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › sequence analysis
profile hidden markov model |
0.8 | 1 | 2024 | ApHMM: Accelerating Profile Hidden Markov Models for Fast and Energy-efficient Genome Analysis · ACM Trans. Archit. Code Optim. 2024 |
Bioinformatics and computational biology
sequence analysis |
0.8 | 1 | 2024 | ApHMM: Accelerating Profile Hidden Markov Models for Fast and Energy-efficient Genome Analysis · ACM Trans. Archit. Code Optim. 2024 |
Hardware accelerators and domain-specific architectures
bioinformatics accelerator |
0.8 | 1 | 2024 | ApHMM: Accelerating Profile Hidden Markov Models for Fast and Energy-efficient Genome Analysis · ACM Trans. Archit. Code Optim. 2024 |
Electronic design automation
hardware/software co-design |
0.2 | 1 | 2024 | ApHMM: Accelerating Profile Hidden Markov Models for Fast and Energy-efficient Genome Analysis · ACM Trans. Archit. Code Optim. 2024 |
Methods — techniques the papers use, named apart from their topics
memoization · 1.5hardware filtering · 1.5baum-welch algorithm · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | ApHMM: Accelerating Profile Hidden Markov Models for Fast and Energy-efficient Genome AnalysisabstractProfile 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, where states and edges capture modifications (i.e., insertions, deletions, and substitutions) by assigning probabilities to them. 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. Accurate computation of these probabilities is essential for the correct identification of sequence similarities. However, the Baum-Welch algorithm is computationally intensive, and existing solutions offer either software-only or hardware-only approaches with fixed pHMM designs. When we analyze state-of-the-art works, we identify an urgent need for a flexible, high-performance, and energy-efficient hardware-software 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 employs hardware-software co-design to tackle 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 unnecessary computations using a hardware-based filter, and (4) minimizing redundant computations. ApHMM achieves substantial speedups of 15.55×–260.03×, 1.83×–5.34×, and 27.97× 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.29×–59.94×, 1.03×–1.75×, and 1.03×–1.95×, respectively, while improving their energy efficiency by 64.24×–115.46×, 1.75×, and 1.96×. Can Firtina, Kamlesh R. Pillai, Gurpreet S. Kalsi, Bharathwaj Suresh, Damla Senol Cali, Jeremie S. Kim, Taha Shahroodi, Meryem Banu Cavlak, Joël Lindegger, Mohammed Alser, Juan Gómez-Luna, Sreenivas Subramoney, Onur Mutlu |
ACM Trans. Archit. Code Optim. | 4 |