Skip to main content
. 2008 May 30;4(5):e1000075. doi: 10.1371/journal.pcbi.1000075

Figure 3. Dynamic programming algorithm for aligning two tree structures, where sons(x) refers to the children of node x, d(x) is a gap penalty, and M(u,v) refers to all mappings between the children of nodes u and v.

Figure 3