GateKeeper-GPU: Fast and Accurate Pre-Alignment Filtering in Short Read Mapping

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Bingöl, Zülal, Alser, Mohammed, Mutlu, Onur, Ozturk, Ozcan, Alkan, Can
Format: Preprint
Publié: 2021
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866910510288470016
author Bingöl, Zülal
Alser, Mohammed
Mutlu, Onur
Ozturk, Ozcan
Alkan, Can
author_facet Bingöl, Zülal
Alser, Mohammed
Mutlu, Onur
Ozturk, Ozcan
Alkan, Can
contents At the last step of short read mapping, the candidate locations of the reads on the reference genome are verified to compute their differences from the corresponding reference segments using sequence alignment algorithms. Calculating the similarities and differences between two sequences is still computationally expensive since approximate string matching techniques traditionally inherit dynamic programming algorithms with quadratic time and space complexity. We introduce GateKeeper-GPU, a fast and accurate pre-alignment filter that efficiently reduces the need for expensive sequence alignment. GateKeeper-GPU provides two main contributions: first, improving the filtering accuracy of GateKeeper (a lightweight pre-alignment filter), and second, exploiting the massive parallelism provided by the large number of GPU threads of modern GPUs to examine numerous sequence pairs rapidly and concurrently. By reducing the work, GateKeeper-GPU provides an acceleration of 2.9x to sequence alignment and up to 1.4x speedup to the end-to-end execution time of a comprehensive read mapper (mrFAST). GateKeeper-GPU is available at https://github.com/BilkentCompGen/GateKeeper-GPU.
format Preprint
id arxiv_https___arxiv_org_abs_2103_14978
institution arXiv
publishDate 2021
record_format arxiv
spellingShingle GateKeeper-GPU: Fast and Accurate Pre-Alignment Filtering in Short Read Mapping
Bingöl, Zülal
Alser, Mohammed
Mutlu, Onur
Ozturk, Ozcan
Alkan, Can
Genomics
Hardware Architecture
At the last step of short read mapping, the candidate locations of the reads on the reference genome are verified to compute their differences from the corresponding reference segments using sequence alignment algorithms. Calculating the similarities and differences between two sequences is still computationally expensive since approximate string matching techniques traditionally inherit dynamic programming algorithms with quadratic time and space complexity. We introduce GateKeeper-GPU, a fast and accurate pre-alignment filter that efficiently reduces the need for expensive sequence alignment. GateKeeper-GPU provides two main contributions: first, improving the filtering accuracy of GateKeeper (a lightweight pre-alignment filter), and second, exploiting the massive parallelism provided by the large number of GPU threads of modern GPUs to examine numerous sequence pairs rapidly and concurrently. By reducing the work, GateKeeper-GPU provides an acceleration of 2.9x to sequence alignment and up to 1.4x speedup to the end-to-end execution time of a comprehensive read mapper (mrFAST). GateKeeper-GPU is available at https://github.com/BilkentCompGen/GateKeeper-GPU.
title GateKeeper-GPU: Fast and Accurate Pre-Alignment Filtering in Short Read Mapping
topic Genomics
Hardware Architecture
url https://arxiv.org/abs/2103.14978