Fig. 3.

Dynamic programming global alignment algorithm of KCaM for two glycan tree structures T₁ and T₂. u and v refer to a particular node u in one tree and node v in the other, and $Q[u,v]$ computes the alignment score of the subtrees rooted at u and v. sons(x) refer to the children of node x, d(x) refers to the gap penalty of deleting node x, M(u, v) refers to the mapping of sons(u) with sons(v), and w(u, v) refers to the score of matching nodes u and v. Further details are described in the text