Algorithmica

, Volume 36, Issue 1, pp 1–39

An Edit Distance between Quotiented Trees

  • Ferraro
  • Godin
Article

Abstract

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.

Keywords

Quotiented tree, Edit distance matching, Dynamic programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 2002

Authors and Affiliations

  • Ferraro
    • 1
  • Godin
    • 1
  1. 1.UMR GNRS-INRA-CIRAD Botanique et Bio-informatique de l'Architecture des Plantes TA 40/PS2, Boulevard de la Lironde, 34398 Montpellier Cedex 5, ferraro@cirad.fr, godin@cirad.fr.France

Personalised recommendations