An Edit Distance between Quotiented Trees | Zendy

Ferraro | Zendy; Christophe Godin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Edit Distance between Quotiented Trees

Author(s) -

Ferraro,

Christophe Godin

Publication year - 2003

Publication title -

algorithmica

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.647

H-Index - 78

eISSN - 1432-0541

pISSN - 0178-4617

DOI - 10.1007/s00453-002-1002-5

Subject(s) - tree (set theory) , computer science , edit distance , relation (database) , algorithm , mathematics , theoretical computer science , combinatorics , data mining

In this paper we propose a dynamic programming algorithm to compare two quotiented trees using a constrained edit distance. A quotiented tree is a tree defined with an additional equivalent relation on vertices and such that the quotient graph is also a tree. The core of the method relies on an adaptation of an algorithm recently proposed by Zhang for comparing unordered rooted trees. This method is currently being used in plant architecture modelling to quantify different types of variability between plants represented by quotiented trees.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research