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 …

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 consisting of …

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 …

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 …

Developers often inspect a diff patch during peer code reviews. Diff patches show low-level
program differences per file without summarizing systematic changes--similar, related …

Edit distances between merge trees of scalar fields have many applications in scientific
visualization, such as ensemble analysis, feature tracking or symmetry detection. In this …

The modern business environment tends to involve a large network of heterogeneous
people, devices and organizations that engage in collaborative processes among …

State-of-the-art database systems manage and process a variety of complex objects,
including strings and trees. For such objects equality comparisons are often not meaningful …

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 …

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 …