Genome Read In-Memory (GRIM) Filter Fast Location Filtering in DNA Read Mapping with Emerging Memory Technologies

  • Authors:
    Jeremie Kim (Carnegie Mellon Univ.), Damla Senol (Carnegie Mellon Univ.), Hongyi Xin (Carnegie Mellon Univ.), Donghyuk Lee (Carnegie Mellon Univ.), Mohammed Alser (Bilkent Univ.), Hasan Hassan (ETHZ), Oguz Ergin (TOBB ETĂś), Can Alkan (Bilkent Univ.), Onur Mutlu (ETHZ)
    Publication ID:
    Publication Type:
    Received Date:
    Last Edit Date:
    2719.001 (Swiss Federal Institute of Technology in Zurich)


In the past couple of decades, high-throughput sequencing (HTS) technology has resulted in a massive influx of available genetic data. Using HTS technology, genomes are sequenced relatively quickly and result in many short DNA read sequences (reads) that are used to analyze the donor's genome. Due to the enormous size and complexity of the human genome, the analysis of the resulting short reads still takes days to complete even if we use state-of-the-art methods. The first step of genome analysis, read mapping, determines the origins of billions of reads within a reference genome to identify the donor's genomic variants. Hash-table based read mappers are a common type of comprehensive read mappers. They operate by fetching from a pre-generated hash table potential mapping locations of a read in the reference genome, which are verified by local alignment, a computationally-expensive dynamic programming algorithm that determines similarity between the read and the potential mapping segment of the reference genome. Alignment has traditionally been the computational bottleneck of read mapping, but recently, many works have been proposing a new step called Location Filtering in order to alleviate this bottleneck.

Location Filtering is a critical step where many incorrect potential locations from the hash table are discarded before local alignment verifies such locations. FastHASH, SHD, and GateKeeper propose variations of Location Filtering that achieve the same goal of discarding only incorrect locations to reduce end-to-end runtime of hash table based read mapping. Location Filtering is now the computational bottleneck of read mapping.

Our goal is to create an efficient Location Filter that quickly discards as many false negative locations as possible before alignment, while retaining a zero false positive rate (i.e., removing candidate locations in the reference genome with low similarity to a read while keeping all locations with high similarity). Efficiently filtering incorrect mappings before alignment significantly improves throughput and latency of hash table based read mapping. We propose a novel filtering algorithm that quickly eliminates from consideration reference genome segments where alignment would yield no matches. Our algorithm's novelty mainly stems from its design to exploit 3D-stacked memory systems. 3D-stacked memory is an emerging technology that tightly integrates computation and high-capacity memory in a single die stack, thereby enabling concurrent processing of large data chunks at low latency and high bandwidth. The key ideas of our design consist of 1) a new representation of coarse-grained segments of the reference genome such that the genome can be operated on in parallel in large chunks using simple bitwise operations and 2) exploiting the parallel computation capability of 3D-stacked memory to run massively-parallel in-memory operations on the new genome representation. We call our resulting filter the GRIM-Filter.

In this work, we show how GRIM-Filter can be used with any hash table based read mapping algorithm and how it effectively exploits processing-in-memory capabilities of 3D-stacked memory. We show that when running with 5% error tolerance, GRIM-Filter results in 5.59x - 6.41x less false positive locations and provides a 1.81x - 3.65x end-to-end speedup over the state-of-the-art read mapper mrFAST with FastHASH.

4819 Emperor Blvd, Suite 300 Durham, NC 27703 Voice: (919) 941-9400 Fax: (919) 941-9450

Important Information for the SRC website. This site uses cookies to store information on your computer. By continuing to use our site, you consent to our cookies. If you are not happy with the use of these cookies, please review our Cookie Policy to learn how they can be disabled. By disabling cookies, some features of the site will not work.