Skip to main content
. 2012 Oct;19(10):1089–1104. doi: 10.1089/cmb.2012.0133

Fig. 1.

Fig. 1.

Example of tree edit operations and edit distance mapping for unordered trees. T2 is obtained from T1 by deletion of node labeled e, insertion of node labeled k, and substitution of node labeled f with node labeled g, in which a tree can contain nodes with the same label. The corresponding mapping M is shown with dashed curves.