Add to ORKGIn this article, we study the behaviour of dynamic programming methods for the tree edit distance problem, such as [4] and [2]. We show that those two algorithms may be described in a more general framework of cover strategies. This analysis allows us to define a new tree edit distance algorithm, that is optimal for cover strategies.
The string correction problem looks at minimal ways to modify one stringinto another using fixed ope...
[[abstract]]One of the most important problem in computational biology is the tree editing problem w...
AbstractThis paper presents a fixed-parameter algorithm for the tree edit distance problem for unord...
AbstractWe study the behavior of dynamic programming methods for the tree edit distance problem, suc...
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...
The tree edit distance (TED), defined as the minimum-cost sequence of node operations that transform...
The edit distance between two rooted ordered trees with $n$ nodes labeled from an alphabet~$\Sigma$ ...
We consider the classical tree edit distance between ordered labelled trees, which is defined as the...
We consider the classical tree edit distance between ordered labeled trees, which is defined as the ...
AbstractIn this paper, we propose a formal definition of a new class of trees called semi-ordered tr...
This paper presents a new method for computing the tree edit distance problem with uniform edit cost...
this paper is to study the definition of edit distances with convex gap weights for trees. In the sp...
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost ...
Ordered labeled trees are trees in which the left-to-right order among siblings is. significant. The...
The string correction problem looks at minimal ways to modify one stringinto another using fixed ope...
[[abstract]]One of the most important problem in computational biology is the tree editing problem w...
AbstractThis paper presents a fixed-parameter algorithm for the tree edit distance problem for unord...
AbstractWe study the behavior of dynamic programming methods for the tree edit distance problem, suc...
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...
The tree edit distance (TED), defined as the minimum-cost sequence of node operations that transform...
The edit distance between two rooted ordered trees with $n$ nodes labeled from an alphabet~$\Sigma$ ...
We consider the classical tree edit distance between ordered labelled trees, which is defined as the...
We consider the classical tree edit distance between ordered labeled trees, which is defined as the ...
AbstractIn this paper, we propose a formal definition of a new class of trees called semi-ordered tr...
This paper presents a new method for computing the tree edit distance problem with uniform edit cost...
this paper is to study the definition of edit distances with convex gap weights for trees. In the sp...
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost ...
Ordered labeled trees are trees in which the left-to-right order among siblings is. significant. The...
The string correction problem looks at minimal ways to modify one stringinto another using fixed ope...
[[abstract]]One of the most important problem in computational biology is the tree editing problem w...
AbstractThis paper presents a fixed-parameter algorithm for the tree edit distance problem for unord...