Computing the Edit-Distance Between Unrooted Ordered Trees
- Cite this paper as:
- Klein P.N. (1998) Computing the Edit-Distance Between Unrooted Ordered Trees. In: Bilardi G., Italiano G.F., Pietracaprina A., Pucci G. (eds) Algorithms — ESA’ 98. ESA 1998. Lecture Notes in Computer Science, vol 1461. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.