GateKeeper: Enabling Fast Pre-Alignment in DNA Short Read Mapping with a New Streaming Accelerator Architecture

Genome analysis helps to reveal the genomic variants that cause diseases and evolution of species. Unfortunately, high throughput DNA sequencing (HTS) technologies generate excessive number of small DNA segments -called short reads- that incur significant computational burden. To analyze the entire genome, each of the billions of short reads must be mapped to a reference genome through a computationally expensive process. Due to sequencing errors and genomic variants, the similarity measurement between a read and "candidate" locations in the reference genome, called alignment, is formulated as an approximate string-matching problem, which is solved using quadratic-time dynamic programming algorithms. In practice, the majority of candidate locations do not align with a given read due to high dissimilarity. The verification process of such candidate locations occupies most of a modern read mapper's execution time. We propose GateKeeper, a new architecture that functions as a pre-alignment step that quickly filters out most incorrect candidate locations. The main idea of GateKeeper is to filter out the incorrect mappings in a streaming fashion using Field-Programmable Gate Arrays (FPGAs). By excluding the incorrect mappings at an early stage, we reduce the number of candidate verifications in the rest of the execution, and thus accelerate the read mapping. GateKeeper is the first design to accelerate pre-alignment using new hardware technologies. On a single FPGA chip, it provides up to 17.3-fold speedup over the state-of-the-art pre-alignment technique, SHD. GateKeeper can provide more than two orders of magnitude speedup over other hardware-accelerated mapping tools such as BWA and BFAST.

[1]  Tsutomu Maruyama,et al.  FPGA acceleration of short read mapping based on sort and parallel comparison , 2014, 2014 24th International Conference on Field Programmable Logic and Applications (FPL).

[2]  Yoko Sogabe,et al.  An acceleration method of short read mapping using FPGA , 2013, 2013 International Conference on Field-Programmable Technology (FPT).

[3]  Knut Reinert,et al.  SeqAn An efficient, generic C++ library for sequence analysis , 2008, BMC Bioinformatics.

[4]  Masanori Hariyama,et al.  FPGA­Accelerator for DNA Sequence Alignment Based on an Ef ficient Data­Dependent Memory Access Scheme , 2014 .

[5]  Yoav Freund,et al.  RIFFA: A Reusable Integration Framework for FPGA Accelerators , 2012, 2012 IEEE 20th International Symposium on Field-Programmable Custom Computing Machines.

[6]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[7]  Bertil Schmidt,et al.  A hybrid short read mapping accelerator , 2013, BMC Bioinformatics.

[8]  Christophe Dessimoz,et al.  SWPS3 – fast multi-threaded vectorized Smith-Waterman for IBM Cell/B.E. and ×86/SSE2 , 2008, BMC Research Notes.

[9]  J. Kitzman,et al.  Personalized Copy-Number and Segmental Duplication Maps using Next-Generation Sequencing , 2009, Nature Genetics.

[10]  Wayne Luk,et al.  Hardware Acceleration of Genetic Sequence Alignment , 2013, ARC.

[11]  Siu-Ming Yiu,et al.  SOAP3: ultra-fast GPU-based parallel alignment tool for short reads , 2012, Bioinform..

[12]  Steven Salzberg,et al.  Short Read Mapping: An Algorithmic Tour , 2017, Proceedings of the IEEE.

[13]  Cole Trapnell,et al.  Ultrafast and memory-efficient alignment of short DNA sequences to the human genome , 2009, Genome Biology.

[14]  M S Waterman,et al.  Identification of common molecular subsequences. , 1981, Journal of molecular biology.

[15]  Richard Durbin,et al.  Sequence analysis Fast and accurate short read alignment with Burrows – Wheeler transform , 2009 .

[16]  Lucian Ilie,et al.  SHRiMP2: Sensitive yet Practical Short Read Mapping , 2011, Bioinform..

[17]  Carl Ebeling,et al.  Hardware Acceleration of Short Read Mapping , 2012, 2012 IEEE 20th International Symposium on Field-Programmable Custom Computing Machines.

[18]  Ümit V. Çatalyürek,et al.  Benchmarking short sequence mapping tools , 2013, BMC Bioinformatics.

[19]  Ying Liu,et al.  High Performance Biological Pairwise Sequence Alignment: FPGA versus GPU versus Cell BE versus GPP , 2012, Int. J. Reconfigurable Comput..

[20]  Srinivas Aluru,et al.  A Review of Hardware Acceleration for Computational Genomics , 2014, IEEE Design & Test.

[21]  Heng Li Aligning sequence reads, clone sequences and assembly contigs with BWA-MEM , 2013, 1303.3997.

[22]  S. B. Needleman,et al.  A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.

[23]  Yongchao Liu,et al.  Faster GPU-Accelerated Smith-Waterman Algorithm with Alignment Backtracking for Short DNA Sequences , 2013, PPAM.

[24]  Steven L Salzberg,et al.  Fast gapped-read alignment with Bowtie 2 , 2012, Nature Methods.

[25]  Wayne Luk,et al.  Reconfigurable Acceleration of Short Read Mapping , 2013, 2013 IEEE 21st Annual International Symposium on Field-Programmable Custom Computing Machines.

[26]  Onur Mutlu,et al.  Accelerating read mapping with FastHASH , 2013, BMC Genomics.

[27]  Faraz Hach,et al.  mrsFAST: a cache-oblivious algorithm for short-read mapping , 2010, Nature Methods.

[28]  S. Nelson,et al.  BFAST: An Alignment Tool for Large Scale Genome Resequencing , 2009, PloS one.

[29]  Can Alkan,et al.  On genomic repeats and reproducibility , 2016, Bioinform..

[30]  Kenny Q. Ye,et al.  An integrated map of genetic variation from 1,092 human genomes , 2012, Nature.

[31]  Nagesh V. Honnalli,et al.  Hobbes: optimized gram-based methods for efficient read alignment , 2011, Nucleic acids research.

[32]  Esko Ukkonen,et al.  Approximate String Matching with q-grams and Maximal Matches , 1992, Theor. Comput. Sci..

[33]  Masanori Hariyama,et al.  Hardware-Acceleration of Short-Read Alignment Based on the Burrows-Wheeler Transform , 2016, IEEE Transactions on Parallel and Distributed Systems.

[34]  Thomas K. F. Wong,et al.  SOAP3-dp: Fast, Accurate and Sensitive GPU-Based Short Read Aligner , 2013, PloS one.

[35]  Ernst Houtgast,et al.  An FPGA-based systolic array to accelerate the BWA-MEM genomic mapping algorithm , 2015, 2015 International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS).

[36]  Onur Mutlu,et al.  Shifted Hamming distance: a fast and accurate SIMD-friendly filter to accelerate alignment verification in read mapping , 2015, Bioinform..

[37]  Eugene W. Myers A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming , 1998, CPM.

[38]  Bin Ma,et al.  PatternHunter II: highly sensitive and fast homology search. , 2003, Genome informatics. International Conference on Genome Informatics.