Skip to main content
Algorithm 2 | Algorithms for Molecular Biology

Algorithm 2

From: Finding maximal exact matches in graphs

Algorithm 2

Cross-product computation for outputting a representation of maximal exact matches using two bidirectional BWT indexes. The input is a MEM candidate computed in Algorithm 1. Here \((a,b,c,d) \in A \otimes B\) iff \((a,b) \in A\), \((c,d) \in B\), \(a\ne c\), and \(b\ne d\).

Back to article page