Cargando…
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...
Autores principales: | Derrien, Thomas, Estellé, Jordi, Marco Sola, Santiago, Knowles, David G., Raineri, Emanuele, Guigó, Roderic, Ribeca, Paolo |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2012
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3261895/ https://www.ncbi.nlm.nih.gov/pubmed/22276185 http://dx.doi.org/10.1371/journal.pone.0030377 |
Ejemplares similares
-
GenMap: ultra-fast computation of genome mappability
por: Pockrandt, Christopher, et al.
Publicado: (2020) -
Modelling and simulating generic RNA-Seq experiments with the flux simulator
por: Griebel, Thasso, et al.
Publicado: (2012) -
Mappability and read length
por: Li, Wentian, et al.
Publicado: (2014) -
Umap and Bismap: quantifying genome and methylome mappability
por: Karimzadeh, Mehran, et al.
Publicado: (2018) -
Paired-end mappability of transposable elements in the human genome
por: Sexton, Corinne E., et al.
Publicado: (2019)