Skip to main content
Figure 5 | Algorithms for Molecular Biology

Figure 5

From: Unrooted unordered homeomorphic subtree alignment of RNA trees

Figure 5

An illustration of Observation2. (a) A node u in a tree T, such that N(u) = {v 1 ,v 2 ,v 3 }, and| T u v 1 || T u v 2 || T u v 3 |. The subtree T u v 1 (bounded by a solid red line) contains T v 2 u and T v 3 u as subtrees (bounded by dashed and dotted blue lines, respectively), and therefore| T v 2 u |,| T v 3 u || T u v 1 || T u v 2 |. (b) The subtree T u v 2 (bounded by a solid red line) contains T v 1 u as a subtree (bounded by a dashed blue line), and therefore| T v 1 u |,| T v 2 u |,| T v 3 u || T u v 2 |. (c) The DP matrix H. The rows of the matrix correspond to subtrees of T, sorted from top to bottom with non-decreasing tree size. Rows corresponding to subtrees of the form T u v i are in solid red, and rows corresponding to subtrees of the form T v i u are in waved-blue. All waved-blue rows have smaller indices than the row corresponding to T u v 2 (circled with a dashed green line).

Back to article page