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...
Guardado en:
Autores principales: | Thomas Derrien, Jordi Estellé, Santiago Marco Sola, David G Knowles, Emanuele Raineri, Roderic Guigó, Paolo Ribeca |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Public Library of Science (PLoS)
2012
|
Materias: | |
Acceso en línea: | https://doaj.org/article/5bfaabaf5be54ea0877d847ee3c5f7d5 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Identification and analysis of splicing quantitative trait loci across multiple tissues in the human genome
por: Diego Garrido-Martín, et al.
Publicado: (2021) -
A general definition and nomenclature for alternative splicing events.
por: Michael Sammeth, et al.
Publicado: (2008) -
Life: Computational Genomics Applications in Life Sciences
por: Yuriy L. Orlov, et al.
Publicado: (2021) -
Exploiting genomic knowledge in optimising molecular breeding programmes: algorithms from evolutionary computing.
por: Steve O'Hagan, et al.
Publicado: (2012) -
Application of Fibonacci heap to fast marching method
por: Meng Fanchang, et al.
Publicado: (2021)