A Constrained Edit Distance Algorithm Between Semi-ordered Trees
Résumé
In this paper, we propose a formal definition of a new class of trees called semi-ordered trees and a polynomial dynamic programming algorithm to compute a constrained edit distance between such trees. The core of the method relies on a similar approach to compare unordered (K. Zhang, 1996, Algorithmica, 15:205-222) and ordered trees (K. Zhang, 1995, Pattern recognition, 28(3):463-474). The method is currently applied to evaluate the similarity between architectures of apple trees (Segura et al., 2007, Euphytica, in press).