PLoS One. 2012;7(1):e30377. Epub 2012 Jan 19.

Fast computation and applications of genome mappability.

Derrien T, Estellé J, Marco Sola S, Knowles DG, Raineri E, Guigó R, Ribeca P.

Source

Institut de Génétique et Développement (IGDR), Université Rennes 1, Rennes, France.

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 (http://gemlibrary.sourceforge.net).

PMID:: 22276185; [PubMed - in process]
PMCID:: PMC3261895

Free PMC Article

Images from this publication.See all images (13) Free text

Figure 7

Cluster of 5S rRNAs on human chr1 exhibiting a very low mappability profile.

This locus explains the peaks observed for annotated rRNAs in the frequency range

Fast Computation and Applications of Genome Mappability

PLoS One. PLoS One;7(1):e30377.

Figure 4

Pileup mappability.

The number of all possible

-mers covering a particular position of the genome (corresponding to nucleotide C) is equal to

(

in this example). The average of the mappabilities of the

-mers can be taken as the pileup mappability. Such a quantity represents how mappable would be this position in a pileup of a whole genome sequencing study with reads of length

Fast Computation and Applications of Genome Mappability

PLoS One. PLoS One;7(1):e30377.

Figure 5

Relation between heterozygosity and pileup mappability.

Low-pileup-mappability regions are more prone to show a high value of heterozygosity than those with high mappability. This is due to the spurious contribution of reads which originate from similar regions belonging to the same mappability group. This figure was obtained for H.sapiens chromosomes

and

out of an in-house experiment with average coverage 30

Fast Computation and Applications of Genome Mappability

PLoS One. PLoS One;7(1):e30377.

Figure 11

Schematic representation of the computation of the paired-end mappability.

In this example the average of the single-end mappabilities at the target position (base C) is bigger than the average of the single-end mappabilities at one of the pairs (base A). Hence the resulting paired-end mappability will be the average of the mean mappabilities at C and A.

Fast Computation and Applications of Genome Mappability

PLoS One. PLoS One;7(1):e30377.

Figure 6

Influence of mismatch values and read lengths on the mappability of the human projected transcriptome as defined by GENCODE [8].

For simplicity, we display the proportion of

-mers having a frequency of

(i.e. uniquely mappable) and those having a frequency

(ambiguous) on the first and second row, respectively. The influence of mismatch number and

-mer lengths are presented in the first and second column, respectively.

Fast Computation and Applications of Genome Mappability

PLoS One. PLoS One;7(1):e30377.

Figure 2

Effect of our approximation on the frequencies of chromosome

of H.sapiens, for

and

. Both the exact and the approximated data were obtained with gem-mappability, the former by setting the value of parameter

, the latter with the default value of

automatically selected by the program after the length of chromosome

of H.sapiens. Each panel shows how our approximation scatters the

-mers originally populating a non-approximate

-bit frequence bin into more than one single approximate bin.

Fast Computation and Applications of Genome Mappability

PLoS One. PLoS One;7(1):e30377.

Figure 10

Read mapping and mappability are different concepts: there is no straightforward relation between the number of times a read matches the genome and the mappability of the regions it maps to.

Within an edit distance of 1 mismatch, the sequence IMG maps uniquely to location ING in the schematic genome “......PING-PONG.....”. However, the matched position is not unique in the genome, since considering 1 mismatch it has a frequency of 2 due to location ONG.

Fast Computation and Applications of Genome Mappability

PLoS One. PLoS One;7(1):e30377.

Figure 3

Visualization of mappability on the UCSC browser [7]: the example of the human TK1 gene.

Six mappability tracks (green) are shown here corresponding to

-mer sizes

and

bp (from top to bottom of the figure). Regions with low mappability score have high frequencies, and conversely. This example illustrates that the uniqueness of the TK1 locus (especially within the introns) could be inversely correlated with the presence of some repetitive elements as identified by RepeatMasker [37].

Fast Computation and Applications of Genome Mappability

PLoS One. PLoS One;7(1):e30377.

Figure 12

Behavior of pileup single-end and paired-end mappabilities at different loci of human chromosome 1 (HSA1).

Parameters used to generate this example were:

-mer length 100, 2 mismatches and a library size of 800 bases. Top left: Heatmap of the number of locations in HSA1 as a function of their single-end and paired-end mappabilities. Bottom left: Histogram of the number of locations in HSA1 that show different single-end and paired-end mappabilities, plotted versus their position along the chromosome. Top right: Heatmap of the number of locations in HSA1 as a function of their single-end mappability and their position along the chromosome. Bottom right: Heatmap of the number of locations in HSA1 as a function of their paired-end mappability and their position along the chromosome.

Fast Computation and Applications of Genome Mappability

PLoS One. PLoS One;7(1):e30377.

Figure 9

Influence of paralogous genes on the mappability scores: the example of the HLA-A gene.

The HLA-A gene is part of the Major Histocompatibility Complex (MHC) involving a large gene family with numerous paralogs. This screenshot of the UCSC genome browser (with the six mappability tracks in green) illustrates the low uniqueness of the HLA-A gene (especially, its exon 4) which could render its targeting by RNASeq difficult (if only uniquely mapping reads are considered).

Fast Computation and Applications of Genome Mappability

PLoS One. PLoS One;7(1):e30377.

Figure 13

Proportion of completely rescuable positions for all human chromosomes.

In this figure we only consider positions having a single-end mappability greater than 1, and for different library sizes (300, 400, 500, 600, 700, 800, 900, 1000, 1500, 2000, 4000, 6000, 8000 and 10000 bp) we plot the fraction of locations which could be rescued by taking advantage of the fact that they have a paired-end mappability equal to one.

Fast Computation and Applications of Genome Mappability

PLoS One. PLoS One;7(1):e30377.

Figure 8

Comparison of Gencode protein-coding genes RPKM and RPKUM expression values as measured in brain tissue (data from [19]).

Both axis are log-scaled, and each dot represents a protein-coding gene with or without annotated paralogous genes (in green and red, respectively). Protein coding genes totally or partially included in segmental duplications are presented in the top panel, whereas those not overlapping segmental duplications are shown in the bottom panel. The figure illustrates the importance of taking into account the mappability information in order not to underestimate expression level. Without mappability correction, two main reasons are shown to introduce a bias in the quantification of expression levels: gene having paralogs, and genes overlapping segmental duplications.

Fast Computation and Applications of Genome Mappability

PLoS One. PLoS One;7(1):e30377.

Figure 1

Effect of our approximation on the frequencies of the C.elegans genome, for

and

. Both the exact and the approximated data were obtained with gem-mappability, the former by setting the value of parameter

, the latter with the default value of

automatically selected by the program after the length of the C.elegans genome. Each panel shows how our approximation scatters the

-mers originally populating a non-approximate

-bit frequence bin into more than one single approximate bin. Using the panel [9]–[10] as an example, one can see that about 80% of the

-mers fall into the correct bin, while the remaining 20% is dispersed in bins from [7]–[8] to [24]–[28], with most of the

-mers staying in bins close to the correct one. In addition, the color of the bins shows that such a 20% of

-mers corresponds in absolute terms to a small number (in this example about the 90% of the

-mers of the genome is unique and hence falls into the [1–1] bin, which, as explained in the text, is not perturbed by our approximation owing to the good properties of the latter).