Figure 3
From: Using cascading Bloom filters to improve the memory usage for de Brujin graphs
Query statistics results for 10M E.coli reads of 100bp using several values of k . The 1 Bloom version corresponds to the one presented in [9]. (a) Total number of queries performed, for each value of k, during a graph traversal. (b) Fraction of resolved queries in B1 and T1 (1 Bloom version) for each value of k. (c) Fraction of resolved queries in B1, B2 and T2 (2 Bloom version) for each value of k. (d) Fraction of resolved queries in B1, B2, B3, B4 and T4 for each value of k.