Authors
Philip N Klein
Publication date
1998/8/24
Book
European Symposium on Algorithms
Pages
91-102
Publisher
Springer Berlin Heidelberg
Description
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.
Total citations
Scholar articles
PN Klein - European Symposium on Algorithms, 1998