Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Some MAX SNP-hard results concerning unordered labeled trees
Information Processing Letters
The String-to-String Correction Problem
Journal of the ACM (JACM)
Introduction to Discrete Structures for Computer Science and Engineering
Introduction to Discrete Structures for Computer Science and Engineering
Local similarity between quotiented ordered trees
Journal of Discrete Algorithms
| Hi-index | 5.23 |
In this paper, we propose a formal definition of a new class oftrees called semi-ordered trees and a polynomial dynamicprogramming algorithm to compute a constrained edit distancebetween such trees. The core of the method relies on a similarapproach to compare unordered [Kaizhong Zhang, A constrained editdistance between unordered labeled trees, Algorithmica 15 (1996)205-222] and ordered trees [Kaizhong Zhang, Algorithms for theconstrained editing distance between ordered labeled trees andrelated problems, Pattern Recognition 28 (3) (1995) 463-474]. Themethod is currently applied to evaluate the similarity betweenarchitectures of apple trees [Vincent Segura, Aida Ouangraoua,Pascal Ferraro, Evelyne Costes, Comparison of tree architectureusing tree edit distances: Application to two-year-old apple tree,Euphytica 161 (2007) 155-164].