Algorithm 1From: Finding maximal exact matches in graphsComputing a representation of \(\kappa\)-MEMs between Q and \(T = T_\text{nodes}\) using their bidirectional BWT indexes. The algorithm explores all MEM candidates and it calls Algorithm 2 to output the MEMs.Back to article page