140 search results - page 1 / 28 » Computing the Edit-Distance between Unrooted Ordered Trees |
ESA
1998
Springer
13 years 8 months ago
1998
Springer
An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The e...
JCB
2006
13 years 4 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
ICALP
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
PKDD
2010
Springer
13 years 2 months ago
2010
Springer
As an alternative to vector representations, a recent trend in image classification suggests to integrate additional structural information in the description of images in order to...
MIAR
2006
IEEE
13 years 10 months ago
2006
IEEE
Abstract. In this paper, we present a novel approach to matching cerebral vascular trees obtained from 3D-RA data-sets based on minimization of tree edit distance. Our approach is ...