Figure 2From: Space-efficient and exact de Bruijn graph representation based on a Bloom filterOptimal data structure size for the parameter r , then for the parameter k . (a) Structure size (Bloom filter, critical false positives) in function of the number of bits per k-mer allocated to the Bloom filter (also called ratio r) for k = 27. The trade-off that optimizes the total size is shown in dashed lines. (b) Optimal size of the structure for different values of k.Back to article page