Table 2 Estimated memory occupation for the case of different values of r vs. single value of r (shown in Table 1), for 4 Bloom filters ( t =4)
From: Using cascading Bloom filters to improve the memory usage for de Brujin graphs
k | Optimalr1,r2,r3,r4 | Bits per k-mer | Bits per k-mer |
|---|---|---|---|
different values ofr | single value ofr | ||
16 | 5.254, 3.541, 4.981, 8.653 | 8.336 | 8.556 |
32 | 5.383, 3.899, 5.318, 9.108 | 8.404 | 8.664 |
64 | 5.572, 4.452, 5.681, 9.108 | 8.512 | 8.824 |
128 | 5.786, 5.108, 6.109, 9.109 | 8.669 | 9.045 |