Skip to main content


Fig. 1 | Algorithms for Molecular Biology

Fig. 1

From: Bloom Filter Trie: an alignment-free and reference-free data structure for pan-genome storage

Fig. 1

Insertion of six suffixes (that are here complete k-mers) with different colors (boxes with diagonal lines) into a BFT with \(k=12\), \(l=4\) and \(c=5\). In a, the first five suffixes are inserted at the root into an uncompressed container. When a sixth suffix gcgccaggaatc is inserted, the uncompressed container exceeds its capacity and is burst, resulting in the BFT structure shown in b

Back to article page