Cargando…
On weighted k-mer dictionaries
We consider the problem of representing a set of [Formula: see text] -mers and their abundance counts, or weights, in compressed space so that assessing membership and retrieving the weight of a [Formula: see text] -mer is efficient. The representation is called a weighted dictionary of [Formula: se...
Autor principal: | Pibiri, Giulio Ermanno |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10276434/ https://www.ncbi.nlm.nih.gov/pubmed/37328897 http://dx.doi.org/10.1186/s13015-023-00226-2 |
Ejemplares similares
-
Sparse and skew hashing of K-mers
por: Pibiri, Giulio Ermanno
Publicado: (2022) -
Locality-preserving minimal perfect hashing of k-mers
por: Pibiri, Giulio Ermanno, et al.
Publicado: (2023) -
Fulgor: A fast and compact k-mer index for large-scale matching and color queries
por: Fan, Jason, et al.
Publicado: (2023) -
Matchtigs: minimum plain text representation of k-mer sets
por: Schmidt, Sebastian, et al.
Publicado: (2023) -
kWIP: The k-mer weighted inner product, a de novo estimator of genetic similarity
por: Murray, Kevin D., et al.
Publicado: (2017)