Figure 5.
Space in average bits/k-mer for LPHash by varying k, for both unpartitioned and partitioned data structures. The flat solid line at bits/k-mer indicates the classic MPHF lower-bound. Lastly, the dashed lines corresponds to the space bounds computed using Theorem 1 and Theorem 3 with and including the space for the fallback MPHF.