Skip to main content
. 2012 Jun 9;28(12):i265–i273. doi: 10.1093/bioinformatics/bts207

Fig. 3.

Fig. 3.

Representation of the match and the deleteL recurrences of the DP algorithm. (a) matchu,v[A, B] is the best score of matching edge ua on edge vb, such that maximally the children A of u and B of v are used. (b) deleteLu,v[A, B] is the best score for deleting edge ua, such that maximally the children A of u and B of v are used. A subset B′⊆B of the children of v can now be matched to the children of a

HHS Vulnerability Disclosure