GEMA+: A Hardware Accelerator for Exact Sequence Mapping Using Learned Indexing with Reduced Sensitivity to Read Length

This paper presents the GEMA+ sequence mapping technique, characterized by its minimal sensitivity to the length of input read sequences. Unlike previously proposed methods, including GEMA and other similar learned index mapping techniques, GEMA+ effectively addresses the challenge of non-uniformity in the ascending trend of the mapping speed with the increasing read length. This challenge is tackled by our innovative process that eliminates the need for padding, which has traditionally been a source of performance variability. GEMA+ retains the efficient data structures of the original GEMA, ensuring no additional memory overhead. Additionally, we propose modifications to the hardware architecture of GEMA, resulting in an efficient implementation of GEMA+ on FPGA devices. The performance of the proposed technique is evaluated through post place-and-route simulations, which reveal that GEMA+ achieves a consistent and uniform increase in mapping speed as read length increases. By reducing performance sensitivity to input sequence length, GEMA+ demonstrates an average performance improvement of 42.5% for short reads and 11.8% for long reads, compared to the original GEMA.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Design Automation of Electronic Systems
Published
2026-04-13
DOI
https://doi.org/10.1145/3803547
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GEMA+: A Hardware Accelerator for Exact Sequence Mapping Using Learned Indexing with Reduced Sensitivity to Read Length

Mohaddeseh Sharei, Mehdi Kamal, M. Pedram, Ali Afzali‐Kusha
ACM Transactions on Design Automation of Electronic Systems
Parallel Computing and Optimization Techniques
article

GEMA+: A Hardware Accelerator for Exact Sequence Mapping Using Learned Indexing with Reduced Sensitivity to Read Length

Mohaddeseh Sharei, Mehdi Kamal, M. Pedram, Ali Afzali‐Kusha
article en

Abstract

This paper presents the GEMA+ sequence mapping technique, characterized by its minimal sensitivity to the length of input read sequences. Unlike previously proposed methods, including GEMA and other similar learned index mapping techniques, GEMA+ effectively addresses the challenge of non-uniformity in the ascending trend of the mapping speed with the increasing read length. This challenge is tackled by our innovative process that eliminates the need for padding, which has traditionally been a source of performance variability. GEMA+ retains the efficient data structures of the original GEMA, ensuring no additional memory overhead. Additionally, we propose modifications to the hardware architecture of GEMA, resulting in an efficient implementation of GEMA+ on FPGA devices. The performance of the proposed technique is evaluated through post place-and-route simulations, which reveal that GEMA+ achieves a consistent and uniform increase in mapping speed as read length increases. By reducing performance sensitivity to input sequence length, GEMA+ demonstrates an average performance improvement of 42.5% for short reads and 11.8% for long reads, compared to the original GEMA.

ACM Transactions on Design Automation of Electronic Systems
University of Southern California (US), University of Tehran (IR), California Southern University (US)
Openalex Percentile: Top 17%
Parallel Computing and Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.