Results 221 to 230 of about 7,310 (242)
Some of the next articles are maybe not open access.
A relation between edit distance for ordered trees and edit distance for Euler strings
Information Processing Letters, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Workflow distance metric based on tree edit distance
Journal of Computer Applications, 2013Nan JIA +4 more
openaire +1 more source
A Linear Tree Edit Distance Algorithm for Similar Ordered Trees
2005We describe a linear algorithm for comparing two similar ordered rooted trees with node labels. The method for comparing trees is the usual tree edit distance. We show that an optimal mapping which uses at most k insertions or deletions can then be constructed in O(nk3) where n is the size of the trees.
openaire +1 more source
Comparison of Tree Edit Distance Algorithms
2012The aim of this thesis is the comparison of the Tree Edit Distance methods, in the context of detecting structural similarity between two XML Schema documents. The methods search the minimum number of edit operations leading from one tree to another. We have analysed and implemented a wide range of the existing tree edit distance approaches.
openaire +2 more sources
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can)
ACM Transactions on Algorithms, 2020Shay Mozes, Oren Weimann
exaly
An optimal decomposition algorithm for tree edit distance
ACM Transactions on Algorithms, 2009Shay Mozes, Oren Weimann
exaly