Cargando…
Theory of local k-mer selection with applications to long-read alignment
MOTIVATION: Selecting a subset of k-mers in a string in a local manner is a common task in bioinformatics tools for speeding up computation. Arguably the most well-known and common method is the minimizer technique, which selects the ‘lowest-ordered’ k-mer in a sliding window. Recently, it has been...
Autores principales: | Shaw, Jim, Yu, Yun William |
---|---|
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/PMC9563685/ https://www.ncbi.nlm.nih.gov/pubmed/36124869 http://dx.doi.org/10.1093/bioinformatics/btab790 |
Ejemplares similares
-
SPRISS: approximating frequent k-mers by sampling reads, and applications
por: Santoro, Diego, et al.
Publicado: (2022) -
Improved assembly of noisy long reads by k-mer validation
por: Carvalho, Antonio Bernardo, et al.
Publicado: (2016) -
LROD: An Overlap Detection Algorithm for Long Reads Based on k-mer Distribution
por: Luo, Junwei, et al.
Publicado: (2020) -
Accurate spliced alignment of long RNA sequencing reads
por: Sahlin, Kristoffer, et al.
Publicado: (2021) -
Effects of spaced k-mers on alignment-free genotyping
por: Häntze, Hartmut, et al.
Publicado: (2023)