Fig. 4
Computation of T[w, (a, b)]. Either a path \(P=(0,\ldots ,w)\) ends with an edge (v, w) with \(v \le a\) (left) or it ends in an edge \((v',w)\) with \(v'>a\) (right)
Fig. 4 | Algorithms for Molecular Biology
Computation of T[w, (a, b)]. Either a path \(P=(0,\ldots ,w)\) ends with an edge (v, w) with \(v \le a\) (left) or it ends in an edge \((v',w)\) with \(v'>a\) (right)
Algorithms for Molecular Biology