Skip to Main content Skip to Navigation
Journal articles

Fast computation and applications of genome mappability.

Abstract : We present a fast mapping-based algorithm to compute the mappability of each region of a reference genome up to a specified number of mismatches. Knowing the mappability of a genome is crucial for the interpretation of massively parallel sequencing experiments. We investigate the properties of the mappability of eukaryotic DNA/RNA both as a whole and at the level of the gene family, providing for various organisms tracks which allow the mappability information to be visually explored. In addition, we show that mappability varies greatly between species and gene classes. Finally, we suggest several practical applications where mappability can be used to refine the analysis of high-throughput sequencing data (SNP calling, gene expression quantification and paired-end experiments). This work highlights mappability as an important concept which deserves to be taken into full account, in particular when massively parallel sequencing technologies are employed. The GEM mappability program belongs to the GEM (GEnome Multitool) suite of programs, which can be freely downloaded for any use from its website (
Complete list of metadatas
Contributor : Hervé de Villemeur <>
Submitted on : Monday, January 30, 2012 - 11:49:46 AM
Last modification on : Wednesday, November 4, 2020 - 6:42:04 PM


Publisher files allowed on an open archive



Thomas Derrien, Jordi Estellé, Santiago Marco Sola, David Knowles, Emanuele Raineri, et al.. Fast computation and applications of genome mappability.. PLoS ONE, Public Library of Science, 2012, 7 (1), pp.e30377. ⟨10.1371/journal.pone.0030377⟩. ⟨inserm-00664289⟩



Record views


Files downloads