Massively parallel read mapping on GPUs with PEANUT

Johannes Koster, Sven Rahmann
Genome Informatics, Institute of Human Genetics, University Hospital Essen, University of Duisburg-Essen
arXiv:1403.1706 [cs.DS], (7 Mar 2014)


   author={K{"o}ster}, J. and {Rahmann}, S.},

   title={"{Massively parallel read mapping on GPUs with PEANUT}"},

   journal={ArXiv e-prints},




   keywords={Computer Science – Data Structures and Algorithms, Computer Science – Distributed, Parallel, and Cluster Computing, Quantitative Biology – Quantitative Methods},




   adsnote={Provided by the SAO/NASA Astrophysics Data System}


We present PEANUT (ParallEl AligNment UTility), a highly parallel GPU-based read mapper with several distinguishing features, including a novel q-gram index (called the q-group index) with small memory footprint built on-the-fly over the reads and the possibility to output both the best hits or all hits of a read. Designing the algorithm particularly for the GPU architecture, we were able to reach maximum core occupancy for several key steps. Our benchmarks show that PEANUT outperforms other state-of- the-art mappers in terms of speed and sensitivity. The software is available at http://peanut.readthedocs.org/.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2021 hgpu.org

All rights belong to the respective authors

Contact us: