Rxivist logo

GenMap: Fast and Exact Computation of Genome Mappability

By Christopher Pockrandt, Mai Alzamel, Costas S. Iliopoulos, Knut Reinert

Posted 26 Apr 2019
bioRxiv DOI: 10.1101/611160

We present a fast and exact algorithm to compute the (k,e)-mappability. Its inverse, the (k,e)-frequency counts the number of occurrences of each k-mer with up to e errors in a sequence. The algorithm we present is a magnitude faster than the algorithm in the widely used GEM suite while not relying on heuristics, and can even compute the mappability for short k-mers on highly repetitive plant genomes. We also show that mappability can be computed on multiple sequences to identify marker genes illustrated by the example of E. coli strains. GenMap allows exporting the mappability information into different formats such as raw output, wig and bed-files. The application and its C++ source code is available on https://github.com/cpockrandt/genmap .

Download data

  • Downloaded 521 times
  • Download rankings, all-time:
    • Site-wide: 35,823 out of 103,802
    • In bioinformatics: 4,514 out of 9,474
  • Year to date:
    • Site-wide: 34,676 out of 103,802
  • Since beginning of last month:
    • Site-wide: 58,029 out of 103,802

Altmetric data

Downloads over time

Distribution of downloads per paper, site-wide


Sign up for the Rxivist weekly newsletter! (Click here for more details.)