Efficient Computation of the Tree Edit Distance

@article{Pawlik2015EfficientCO,
  title={Efficient Computation of the Tree Edit Distance},
  author={Mateusz Pawlik and Nikolaus Augsten},
  journal={ACM Trans. Database Syst.},
  year={2015},
  volume={40},
  pages={3:1-3:40}
}
We consider the classical tree edit distance between ordered labelled trees, which is defined as the minimum-cost sequence of node edit operations that transform one tree into another. The state-of-the-art solutions for the tree edit distance are not satisfactory. The main competitors in the field either have optimal worst-case complexity but the worst case happens frequently, or they are very efficient for some tree shapes but degenerate for others. This leads to unpredictable and often… CONTINUE READING