Skip to main content

Table 1 1st column: k -mer size; 2nd and 4th columns: optimal value of r for Bloom filters (bitmap size per number of stored elements) for t =4 and t =6 respectively; 3rd and 5th columns: the resulting space per k -mer (for t =4 and t =6); 6th column: space per k -mer for the method of [[9]] ( t =1)

From: Using cascading Bloom filters to improve the memory usage for de Brujin graphs

k

Optimalr

Bits per k-mer

Optimalr

Bits per k-mer

Bits per k-mer

 

for t=4

for t=4

for t=6

for t=6

for t=1 ([9])

16

5.777

8.556

5.506

8.459

12.078

32

6.049

8.664

5.556

8.470

13.518

64

6.399

8.824

5.641

8.490

14.958

128

6.819

9.045

5.772

8.524

16.398