A data structure for dynamic trees
Journal of Computer and System Sciences
Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
On the editing distance between unordered labeled trees
Information Processing Letters
Change detection in hierarchically structured information
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
A tree-edit-distance algorithm for comparing simple, closed shapes
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
New algorithm for ordered tree-to-tree correction problem
Journal of Algorithms
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Computing similarity between RNA structures
Theoretical Computer Science
Comparing Hierarchical Data in External Memory
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Computing the Edit-Distance between Unrooted Ordered Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Region-Based Modeling and Tree Edit Distance as a Basis for Gesture Recognition
ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
Detecting Changes in XML Documents
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Automatic web news extraction using tree edit distance
Proceedings of the 13th international conference on World Wide Web
An Efficient Algorithm to Compute Differences between Structured Documents
IEEE Transactions on Knowledge and Data Engineering
XML stream processing using tree-edit distance embeddings
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Similarity evaluation on tree-structured data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
A survey on tree edit distance and related problems
Theoretical Computer Science
An incrementally maintainable index for approximate lookups in hierarchical data
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Web Information Extraction by HTML Tree Edit Distance Matching
ICCIT '07 Proceedings of the 2007 International Conference on Convergence Information Technology
Melody Recognition with Learned Edit Distances
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Approximate Joins for Data-Centric XML
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
An optimal decomposition algorithm for tree edit distance
ACM Transactions on Algorithms (TALG)
The pq-gram distance between ordered labeled trees
ACM Transactions on Database Systems (TODS)
A methodology for clustering XML documents by structure
Information Systems
Measuring tree similarity for natural language processing based information retrieval
NLDB'10 Proceedings of the Natural language processing and information systems, and 15th international conference on Applications of natural language to information systems
An improved algorithm for tree edit distance incorporating structural linearity
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Indexing for subtree similarity-search using edit distance
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Retrieving documents with mathematical content
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
RWS-Diff: flexible and efficient change detection in hierarchical data
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Relational abstract interpretation for the verification of 2-hypersafety properties
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Synthetising changes in XML documents as PULs
Proceedings of the VLDB Endowment
On repairing structural problems in semi-structured data
Proceedings of the VLDB Endowment
Natural language inference for arabic using extended tree edit distance with subtrees
Journal of Artificial Intelligence Research
Event-driven agility of interoperability during the Run-time of collaborative processes
Decision Support Systems
Hi-index | 0.00 |
We consider the classical tree edit distance between ordered labeled trees, which is defined as the minimum-cost sequence of node edit operations that transform one tree into another. The state-of-the-art solutions for the tree edit distance are not satisfactory. The main competitors in the field either have optimal worst-case complexity, but the worst case happens frequently, or they are very efficient for some tree shapes, but degenerate for others. This leads to unpredictable and often infeasible runtimes. There is no obvious way to choose between the algorithms. In this paper we present RTED, a robust tree edit distance algorithm. The asymptotic complexity of RTED is smaller or equal to the complexity of the best competitors for any input instance, i.e., RTED is both efficient and worst-case optimal. We introduce the class of LRH (Left-Right-Heavy) algorithms, which includes RTED and the fastest tree edit distance algorithms presented in literature. We prove that RTED outperforms all previously proposed LRH algorithms in terms of runtime complexity. In our experiments on synthetic and real world data we empirically evaluate our solution and compare it to the state-of-the-art.