Fast computation and applications of genome mappability.

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 m...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Thomas Derrien, Jordi Estellé, Santiago Marco Sola, David G Knowles, Emanuele Raineri, Roderic Guigó, Paolo Ribeca
Format: article
Langue:EN
Publié: Public Library of Science (PLoS) 2012
Sujets:
R
Q
Accès en ligne:https://doaj.org/article/5bfaabaf5be54ea0877d847ee3c5f7d5
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!