Skip to main content
Search
Explore journals
Get published
About BMC
My account
Search all BMC articles
Search
Algorithms for Molecular Biology
Home
About
Articles
Submission Guidelines
Table 4
Estimated fractions of queries resolved by each filter and by the explicitely stored set
T
_{ t }
for
t
=1,2,4, computed for
k
=32 and optimal value of
r
shown in the second column
From:
Using cascading Bloom filters to improve the memory usage for de Brujin graphs
Value of
t
r
B
_{1}
B
_{2}
B
_{3}
B
_{4}
T
_{ t }
1
11.44
74.70
%
0
0
0
25.3
%
2
8.060
73.44
%
24.48
%
0
0
2.08
%
4
6.049
70.90
%
23.63
%
3.88
%
1.29
%
0.3
%
Back to article page