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 …

In this paper, we propose the alignment of trees as a measure of the similarity between two
labeled trees. Both ordered and unordered trees are considered. An algorithm is designed …

Due to the fact that no NP-complete problem can be solved in polynomial time (unless P=
NP), many approximability results (both positive and negative) of NP-hard optimization …

Issues of matching and searching on elementary discrete structures arise pervasively in
computer science and many of its applications, and their relevance is expected to grow as …

This paper considers the problem of computing a constrained edit distance between
unordered labeled trees. The problem of approximate unordered tree matching is also …

Software-merging techniques face the challenge of finding a balance between precision and
performance. In practice, developers use unstructured-merge (ie, line-based) tools, which …

As more and more neuroanatomical data are made available through efforts such as
NeuroMorpho. Org and FlyCircuit. org, the need to develop computational tools to facilitate …

This paper considers the problem of computing a constrained editing distance between
ordered labeled trees. This distance metric can be applied to pattern recognition, syntactic …

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 Subtree Isomorphism problem asks whether a given tree is contained in another given
tree. The problem is of fundamental importance and has been studied since the 1960s. For …