An edit distance between quotiented trees - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Algorithmica Année : 2003

An edit distance between quotiented trees

Résumé

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.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
s00453-002-1002-5-1.pdf (588.7 Ko) Télécharger le fichier
Vignette du fichier
ferraro03a.jpg (18.79 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Format : Figure, Image

Dates et versions

hal-00307409 , version 1 (08-12-2008)

Identifiants

  • HAL Id : hal-00307409 , version 1
  • PRODINRA : 318369

Citer

Pascal Ferraro, Christophe Godin. An edit distance between quotiented trees. Algorithmica, 2003, 36, pp.1-39. ⟨hal-00307409⟩
385 Consultations
519 Téléchargements

Partager

Gmail Facebook X LinkedIn More