Abstract. An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The edit distance between A and B is the minimum cost of a sequence of operations (contract an edge, uncontract an edge, modify the label of an edge) needed to transform A into B. We give an O(n 3 log n) algorithm to compute the edit distance between two ordered trees.
REF improved it to O(n 3 log n).
Computing the edit-distance between unrooted ordered trees
In Proceedings of the 6th annual European Symposium on Algorithms (ESA
Mathematics Computer Science