Name
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/s00453-002-1002-5 | Algorithmica |
Keywords | Field | DocType |
Quotiented tree,Edit distance matching,Dynamic programming | Edit distance,Dynamic programming,Distance measurement,Discrete mathematics,Combinatorics,Tree (graph theory),Vertex (geometry),Quotient graph,Mathematics | Journal |
Volume | Issue | ISSN |
36 | 1 | 0178-4617 |
Citations | PageRank | References |
7 | 0.56 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pascal Ferraro | 1 | 77 | 11.54 |
| Christophe Godin | 2 | 121 | 13.97 |