Fig. 1
From: Automated design of dynamic programming schemes for RNA folding with pseudoknots
Given a finite number of arbitrary fatgraphs, a dynamic programming scheme for folding (restricted to the family of structures specified by the fatgraphs) is derived from canonical tree decompositions of minimal representative expansions of the helices, for each fatgraph. The workflow gives an overview of the steps of the algorithm. Each step is described in more details in the subsequent sections and figures: see Fig. 2 for fatgraphs, Fig. 5 and Sect. "Minimal representative expansion of a fatgraph" for a detailed version of the canonical tree decomposition, Fig. 8 for a detailed view of the compact skeleton of the tree decomposition