Cargando…
Locality-preserving minimal perfect hashing of k-mers
MOTIVATION: Minimal perfect hashing is the problem of mapping a static set of n distinct keys into the address space [Formula: see text] bijectively. It is well-known that [Formula: see text] bits are necessary to specify a minimal perfect hash function (MPHF) f, when no additional knowledge of the...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Oxford University Press
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10311298/ https://www.ncbi.nlm.nih.gov/pubmed/37387137 http://dx.doi.org/10.1093/bioinformatics/btad219 |