Locality-Preserving Minimal Perfect Hashing of k-mers

Giulio Ermanno Pibiri, Yoshihiro Shibuya, Antoine Limasset

Minimal perfect hashing is the problem of mapping a static set of $n$ distinct keys into the address space $\{1,\dots ,n\}$ bijectively. It is well-known that $n{\log }_2(e)$ bits are…