Skip to main content
Fig. 4 | Algorithms for Molecular Biology

Fig. 4

From: Co-linear chaining on pangenome graphs

Fig. 4

A worst-case example for Algorithm 3 where it requires \(\Omega (N)\) iterations to converge (Lemma 6). We show a step-by-step progress of the algorithm with each iteration. The table shows the values in array C after each iteration

Back to article page