Fig. 6From: Space-efficient computation of k-mer dictionaries for large values of kEstimated memory usage of the three main data structures of Kaarme during memory peak. SB = secondary buffer, HT = hash table, BF = bloom filter. Bloom filter size is doubled during filtering but is then halved when the unneeded first filter is deletedBack to article page