Skip to main content
. 2023 Jun 30;39(Suppl 1):i534–i543. doi: 10.1093/bioinformatics/btad219

Figure 5.

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 log2(e)=1.442 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 b=2.5 and including the space for the fallback MPHF.