Cargando…
GenMap: ultra-fast computation of genome mappability
MOTIVATION: Computing the uniqueness of k-mers for each position of a genome while allowing for up to e mismatches is computationally challenging. However, it is crucial for many biological applications such as the design of guide RNA for CRISPR experiments. More formally, the uniqueness or (k, e)-m...
Autores principales: | Pockrandt, Christopher, Alzamel, Mai, Iliopoulos, Costas S, Reinert, Knut |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7320602/ https://www.ncbi.nlm.nih.gov/pubmed/32246826 http://dx.doi.org/10.1093/bioinformatics/btaa222 |
Ejemplares similares
-
Fast Computation and Applications of Genome Mappability
por: Derrien, Thomas, et al.
Publicado: (2012) -
Genomic dark matter: the reliability of short read mapping illustrated by the genome mappability score
por: Lee, Hayan, 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)