AbstractWe 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, alignment distance, and inclusion problem. For each problem we review the results available and present, in detail, one or more of the central algorithms for solving the problem
Paaßen B. Revisiting the tree edit distance and its backtracing: A tutorial. arXiv:1805.06869. Draft...
We consider the classical tree edit distance between ordered labeled trees, which is defined as the ...
AbstractDefining and computing distances between tree structures is a classical area of study in the...
AbstractWe survey the problem of comparing labeled trees based on simple local operations of deletin...
[[abstract]]One of the most important problem in computational biology is the tree editing problem w...
AbstractWe describe a linear-time algorithm for comparing two similar ordered rooted trees with node...
AbstractIn this paper, we propose the alignment of trees as a measure of the similarity between two ...
In a number of practical situations, data have structure and the relations among its component parts...
AbstractIn this paper, we propose the alignment of trees as a measure of the similarity between two ...
We consider the tree alignment distance problem between a tree and a regular tree language. The tree...
We present an algorithm to approximate edit distance between two ordered and rooted trees of bounded...
Ordered labeled trees are trees in which the left-to-right order among siblings is. significant. The...
In this paper, we propose tree edit distance with variables, which is an extension of the tree edit ...
Abstract. This paper investigates a technique to extend the tree edit distance framework to allow th...
AbstractWe study the behavior of dynamic programming methods for the tree edit distance problem, suc...
Paaßen B. Revisiting the tree edit distance and its backtracing: A tutorial. arXiv:1805.06869. Draft...
We consider the classical tree edit distance between ordered labeled trees, which is defined as the ...
AbstractDefining and computing distances between tree structures is a classical area of study in the...
AbstractWe survey the problem of comparing labeled trees based on simple local operations of deletin...
[[abstract]]One of the most important problem in computational biology is the tree editing problem w...
AbstractWe describe a linear-time algorithm for comparing two similar ordered rooted trees with node...
AbstractIn this paper, we propose the alignment of trees as a measure of the similarity between two ...
In a number of practical situations, data have structure and the relations among its component parts...
AbstractIn this paper, we propose the alignment of trees as a measure of the similarity between two ...
We consider the tree alignment distance problem between a tree and a regular tree language. The tree...
We present an algorithm to approximate edit distance between two ordered and rooted trees of bounded...
Ordered labeled trees are trees in which the left-to-right order among siblings is. significant. The...
In this paper, we propose tree edit distance with variables, which is an extension of the tree edit ...
Abstract. This paper investigates a technique to extend the tree edit distance framework to allow th...
AbstractWe study the behavior of dynamic programming methods for the tree edit distance problem, suc...
Paaßen B. Revisiting the tree edit distance and its backtracing: A tutorial. arXiv:1805.06869. Draft...
We consider the classical tree edit distance between ordered labeled trees, which is defined as the ...
AbstractDefining and computing distances between tree structures is a classical area of study in the...
DOI
Add to ORKG