Abstract
DNA read mapping is a computationally expensive bioinformatics task, required for genome assembly and consensus polishing. It requires to find the best-fitting location for each DNA read on a long reference sequence. A novel resistive approximate similarity search accelerator (RASSA) exploits charge distribution and parallel in-memory processing to reflect a mismatch count between DNA sequences. RASSA implementation of DNA long-read prealignment outperforms the state-of-the-art solution, minimap2, by 16-77× with comparable accuracy and provides two orders of magnitude higher throughput than GateKeeper, a short-read prealignment hardware architecture implemented in FPGA.
Original language | English |
---|---|
Article number | 8594624 |
Pages (from-to) | 44-54 |
Number of pages | 11 |
Journal | IEEE Micro |
Volume | 39 |
Issue number | 4 |
DOIs | |
State | Published - 1 Jul 2019 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2018 IEEE.