Fig. 9
From: Automated design of dynamic programming schemes for RNA folding with pseudoknots
Derivation of DP equations from a skeleton, starting from the canonical tree decomposition of a length-5 expansion for a simple H-type fatgraph. On the left-hand-side, special emphasis is given to explaining how values are mapped at the end of a diagonal case. Extra tables \(C_\boxtimes '\) and \(D'_H\), needed to ensure unambiguity of the DP scheme, are omitted for the sake of simplicity without adverse consequences to correctness