Figure 1
From: Using cascading Bloom filters to improve the memory usage for de Brujin graphs
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) Size of the structure in bits used per k-mer stored. (b) Number of false positives stored in T1, T2 or T4 for 1, 2 or 4 Bloom filters, respectively. (c) De Bruijn graph traversal time, including branching k-mer indexing. (d) De Bruijn graph construction time, excluding k-mer counting step.