An Introduction to Bioinformatics for Glycomics Research (original) (raw)
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.