From: Using cascading Bloom filters to improve the memory usage for de Brujin graphs
Method | 1 Bloom[9] | 2 Bloom | 4 Bloom |
---|---|---|---|
Construction time (s) | 40160.7 | 43362.8 | 44300.7 |
Traversal time (s) | 46596.5 | 35909.3 | 34177.2 |
r coefficient | 11.10 | 7.80 | 5.97 |
B1=3250.95 | B1=2283.64 | B1=1749.04 | |
B2=323.08 | B2=591.57 | ||
Bloom filters size (MB) | B3=100.56 | ||
B4=34.01 | |||
False positive table | T1=545.94 | T2=425.74 | T4=36.62 |
size (MB) | |||
Total size (MB) | 3796.89 | 3032.46 | 2511.8 |
Size (bits/ k -mer) | 12.96 | 10.35 | 8.58 |