Hierarchical data are often modelled as trees. An interesting query identifies pairs of similar
trees. The standard approach to tree similarity is the tree edit distance, which has …

We consider the classical tree edit distance between ordered labeled trees, which is defined
as the minimum-cost sequence of node edit operations that transform one tree into another …

The notion of graph which is most useful in computer science is that of a directed graph or
just a graph. A graph is a combinatorial structure consisting of a finite nonempty set of …

We consider the classical tree edit distance between ordered labelled trees, which is
defined as the minimum-cost sequence of node edit operations that transform one tree into …

With the increasing number of available XML documents, numerous approaches for retrieval
have been proposed in the literature. They usually use the tree representation of documents …

Many methods have been proposed for RNA secondary structure comparison, and new
ones are still being developed. In this chapter, we first consider structure representations …

The tree edit distance (TED) has been found in a wide spectrum of applications in artificial
intelligence, bioinformatics, and other areas, which serves as a metric to quantify the …

We describe a theoretical unifying framework to express the comparison of RNA structures,
which we call alignment hierarchy. This framework relies on the definition of common …

The (unweighted) tree edit distance problem for node trees asks to compute a measure of
dissimilarity between two rooted trees with node labels. The current best algorithm from …

The tree edit distance (TED), defined as the minimum-cost sequence of node operations that
transform one tree into another, is a well-known distance measure for hierarchical data …