We survey the problem of comparing labeled trees based on simple local operations of
deleting, inserting, and relabeling nodes. These operations lead to the tree edit distance …

The intuitive description of small and large molecules using graphs has led to an increasing
interest in the application of graph concepts for describing, analyzing, and comparing small …

Comparative phylogeography has emerged as a means of understanding the spatial
patterns of genetic divergence of codistributed species. However, researchers are often …

The minimum common supergraph of two graphs, g 1 and g 2, is defined as the smallest
graph that includes, as subgraphs, both g 1 and g 2. It is shown that minimum common …

Suppose a set of arbitrary (unlabeled) images contains frequent occurrences of 2D objects
from an unknown category. This paper is aimed at simultaneously solving the following …

Ubiquitous in data analysis are problems of aggregation such as this one: Given a set X of
objects of interest, identify an appropriate consensus rule C: X k→ X that, when presented ak …

In this paper we investigate a new approach to the similarity of tonal harmony. We create a
fully functional remodeling of an earlier version of Rohrmeier's grammar of harmony. With …

Mining structured information has been the source of much research in the data mining
community over the last decade. The field of bioinformatics has emerged as important …

We survey the problem of comparing labeled trees based on simple local operations of
deleting, inserting and relabeling nodes. These operations lead to the tree edit distance …

A widely used method for determining the similarity of two labeled trees is to compute a
maximum agreement subtree of the two trees. Previous work on this similarity measure has …