Compact and evenly distributed k-mer binning for genomic sequences

Mostrar otras versiones (1)

MOTIVATION: The processing of k-mers (subsequences of length k) is at the foundation of many sequence processing algorithms in bioinformatics, including k-mer counting for genome size estimation, genome assembly, and taxonomic classification for metagenomics. Minimizers—ordered m-mers where m < k...

Descripción completa

Detalles Bibliográficos
Autores principales: Nyström-Persson, Johan, Keeble-Gagnère, Gabriel, Zawad, Niamat
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Oxford University Press 2021
Materias:
Original Papers
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8428581/
https://www.ncbi.nlm.nih.gov/pubmed/33693556
http://dx.doi.org/10.1093/bioinformatics/btab156

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8428581/
https://www.ncbi.nlm.nih.gov/pubmed/33693556
http://dx.doi.org/10.1093/bioinformatics/btab156

Ejemplares similares