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 …

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 …

When integrating data from autonomous sources, exact matches of data items that represent
the same real world object often fail due to a lack of common keys. Yet in many cases …

When integrating data from autonomous sources, exact matches of data items that represent
the same real-world object often fail due to a lack of common keys. Yet in many cases …

In data mining, computing the similarity of objects is an essential task, for example to identify
regularities or to build homogeneous clusters of objects. In the case of sequential data seen …

In data integration applications, a join matches elements that are common to two data
sources. Often, however, elements are represented slightly different in each source, so an …

Refactoring is one of the promising techniques for improving program design by means of
program transformation with preserving behavior, and is widely applied in practice …

The problem of generating a cost-minimal edit script between two trees has many important
applications. However, finding such a cost-minimal script is computationally hard, thus the …

There are two main approaches to manage changes in XML documents, change‐tracking
and diff. Change‐tracking tools, which record edit actions while they are performed on the …