Figure 7
From: Unrooted unordered homeomorphic subtree alignment of RNA trees

The incorporation of cavity matching subroutines in the DP algorithm. (a) Upon reaching the entry corresponding to and, all values of the form for v j  ∈ N(u) ∖ {v1} and are computed (see (b)). This allows to compute all values, by solving the All-Cavity-MCM problem over the instance, and thus computing term III with respect to all remaining entries in the first row of. (c) Upon reaching the entry corresponding to and, all values of the form for v j  ∈ N(u) and are computed (see (d)). This allows to compute all values, by solving the All-Pairs-Cavity-MCM problem over the instance, and thus computing term III with respect to all remaining entries in.