Algorithm 1
From: Fulgor: a fast and compact k-mer index for large-scale matching and color queries
The \(\textsc {Full-Intersection}\) algorithm for a query sequence Q. The algorithm uses the three index components: \(\mathcal {D}\) (the dictionary, mapping \(k\)-mers to unitigs), B (the bit-vector mapping from unitigs to colors), and \(\mathcal {L}\) (the inverted index storing the compressed colors). As discussed in Section , the dictionary \(\mathcal {D}\) can stream through the query sequence Q and collect unitig ids. The inverted index \(\mathcal {L}\), instead, returns an iterator over a color set given the color id c as \(\textsc {Iterator}{(c)}\)