Algorithm 3
From: Fulgor: a fast and compact k-mer index for large-scale matching and color queries
The \(\textsc {Threshold-Union}\) algorithm for a query sequence Q. Differently from the full-intersection method (Algorithm 1), here U, C, and I, are sets of pairs. The first component of a pair is a unitig id, a color id, or an iterator, respectively if the pair is in U, C, or U. The second component, read by calling the method \(\textsc {Score}{()}\) in the pseudocode, is the number of positive \(k\)-mers that have a given unitig id or have a given color. The score of iterator i is the score of the color id c if \(i=\mathcal {L}.\textsc {Iterator}{(c)}\). Clearly, when deduplicating the sets U and C, the scores of equal unitig or color ids must be summed