Abstract

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

Citations

537	The String-to-String Correction Problem - Wagner, Fischer - 1974
265	A data structure for dynamic trees - Sleator, Tarjan - 1983
255	Simple fast algorithms for the editing distance between trees and related problems - Zhang, Shasha - 1989
239	Topological graph theory - Gross, Tucker - 2001
179	The tree-to-tree correction problem - Tai - 1979
115	Comparing multiple RNA secondary structures using tree comparisons - Shapiro, Zhang - 1990
100	A constrained edit distance between unordered labeled trees - Zhang - 1996
58	A system for approximate tree matching - Wang, Zhang, et al. - 1994
44	Approximate Tree Pattern Matching - Shasha, Zhang - 1997
40	On a cyclic string-to-string correction problem - Maes - 1990
17	Tarjan, "A data structure for dynamic trees - Sleator, E - 1983
2	Approximate Tree Pattern Matching, chapter 14 Pattern Matching Algorithms - Shasha, Zhang - 1997