Repository: Freie Universit├Ąt Berlin, Math Department

GenMap: ultra-fast computation of genome mappability

Reinert, Knut and Iliopoulos, Costas S and Alzamel, Mai and Pockrandt, Christopher and Xu, Jinbo (2020) GenMap: ultra-fast computation of genome mappability. Bioinformatics, 36 (12). pp. 3687-3692. ISSN 1367-4803

Full text not available from this repository.

Official URL:


Motivation: Computing the uniqueness of k-mers for each position of a genome while allowing for up to e mismatches is computationally challenging. However, it is crucial for many biological applications such as the design of guide RNA for CRISPR experiments. More formally, the uniqueness or (k, e)-mappability can be described for every position as the reciprocal value of how often this k-mer occurs approximately in the genome, i.e. with up to e mismatches. Results: We present a fast method GenMap to compute the (k, e)-mappability. We extend the mappability algorithm, such that it can also be computed across multiple genomes where a k-mer occurrence is only counted once per genome. This allows for the computation of marker sequences or finding candidates for probe design by identifying approximate k-mers that are unique to a genome or that are present in all genomes. GenMap supports different formats such as binary output, wig and bed files as well as csv files to export the location of all approximate k-mers for each genomic position. Availability and implementation: GenMap can be installed via bioconda. Binaries and C++ source code are available on

Item Type:Article
Subjects:Mathematical and Computer Sciences > Computer Science
Divisions:Department of Mathematics and Computer Science > Institute of Computer Science > Algorithmic Bioinformatics Group
ID Code:2515
Deposited By: Anja Kasseckert
Deposited On:18 Mar 2021 12:42
Last Modified:18 Mar 2021 12:42

Repository Staff Only: item control page