Cargando…
Compact and evenly distributed k-mer binning for genomic sequences
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...
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: | |
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 |
Ejemplares similares
-
Compact and evenly distributed k-mer binning for genomic sequences
por: Nyström-Persson, Johan, et al.
Publicado: (2021) -
Advances in genome studies in plants and animals
por: Appels, R., et al.
Publicado: (2014) -
Discoveries and advances in plant and animal genomics
por: Appels, Rudi, et al.
Publicado: (2015) -
The K-mer File Format: a standardized and compact disk representation of sets of k-mers
por: Dufresne, Yoann, et al.
Publicado: (2022) -
Compact representation of k-mer de Bruijn graphs for genome read assembly
por: Rødland, Einar Andreas
Publicado: (2013)