TL;DR
GRIM-Filter is a processing-in-memory algorithm that accelerates seed location filtering in DNA read mapping, significantly reducing false negatives and speeding up the overall process by leveraging 3D-stacked memory systems.
Contribution
It introduces a novel PIM-based seed filtering algorithm that improves accuracy and speed in DNA read mapping compared to previous methods.
Findings
Reduces false negative rate by up to 6.41x
Achieves 1.81x to 3.65x speedup in end-to-end read mapping
Utilizes 3D-stacked memory for massively-parallel in-memory operations
Abstract
Motivation: Seed location filtering is critical in DNA read mapping, a process where billions of DNA fragments (reads) sampled from a donor are mapped onto a reference genome to identify genomic variants of the donor. State-of-the-art read mappers 1) quickly generate possible mapping locations for seeds (i.e., smaller segments) within each read, 2) extract reference sequences at each of the mapping locations, and 3) check similarity between each read and its associated reference sequences with a computationally-expensive algorithm (i.e., sequence alignment) to determine the origin of the read. A seed location filter comes into play before alignment, discarding seed locations that alignment would deem a poor match. The ideal seed location filter would discard all poor match locations prior to alignment such that there is no wasted computation on unnecessary alignments. Results: We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
