Computing the Edit-Distance between Unrooted Ordered Trees

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(n3 log n) algorithm to compute the edit distance between two ordered trees.

• Type: Conference
• Year: 1998
• Where: ESA
• Authors: Philip N. Klein
• Keywords: Algorithms, Edit Distance, ESA 1998, Node's Incident Edges, Ordered Trees