A relation between edit distance for ordered trees and edit distance for Euler strings
We consider a relationship between the unit cost edit distance for two rooted ordered trees and the unit cost edit distance for the corresponding Euler strings. We show that the edit distance between trees is at least half of the edit distance between the Euler strings and is at most 2h + 1 times the edit distance between the Euler strings, where h is the minimum height of two trees. The result can be extended for more general cost functions. (c) 2006 Elsevier B.V. All rights reserved.
edit distance ordered trees euler string algorithms alignment