pith. sign in

arxiv: 1403.1706 · v1 · pith:5WUULP6Enew · submitted 2014-03-07 · 💻 cs.DS · cs.DC· q-bio.QM

Massively parallel read mapping on GPUs with PEANUT

classification 💻 cs.DS cs.DCq-bio.QM
keywords peanutparallelreadhitsindexseveralablealgorithm
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.