Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Fast algorithms for the unit cost editing distance between trees
Journal of Algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Pattern matching algorithms
The String-to-String Correction Problem
Journal of the ACM (JACM)
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
Algorithms on Trees and Graphs
Algorithms on Trees and Graphs
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
A survey on tree edit distance and related problems
Theoretical Computer Science
Analysis of tree edit distance algorithms
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Faster algorithms for guided tree edit distance
Information Processing Letters
Fast Algorithms for Computing Tree LCS
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Improved approximation of the largest common subtree of two unordered trees of bounded height
Information Processing Letters
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
A Tree Distance Function Based on Multi-sets
New Frontiers in Applied Data Mining
Sibling Distance for Rooted Labeled Trees
New Frontiers in Applied Data Mining
Split-Order Distance for Clustering and Classification Hierarchies
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Fast RNA Structure Alignment for Crossing Input Structures
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Fast algorithms for computing tree LCS
Theoretical Computer Science
Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
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)
Optimizing textual entailment recognition using particle swarm optimization
TextInfer '09 Proceedings of the 2009 Workshop on Applied Textual Inference
Finding common structured patterns in linear graphs
Theoretical Computer Science
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Algorithms for forest pattern matching
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
Fundamenta Informaticae
Approximate joins for XML using g-string
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Exact algorithms for computing the tree edit distance between unordered trees
Theoretical Computer Science
pq-hash: an efficient method for approximate XML joins
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes
Theoretical Computer Science
Fast RNA structure alignment for crossing input structures
Journal of Discrete Algorithms
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
Ingredients for accurate, fast, and robust XML similarity joins
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Finding common RNA pseudoknot structures in polynomial time
Journal of Discrete Algorithms
On the configuration of the similarity search data structure d-index for high dimensional objects
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part III
Local exact pattern matching for non-fixed RNA structures
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
An improved algorithm for tree edit distance incorporating structural linearity
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Extracting differences between regular tree grammars
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Algorithms for local similarity between forests
Journal of Combinatorial Optimization
Event-driven agility of interoperability during the Run-time of collaborative processes
Decision Support Systems
| Hi-index | 0.00 |
The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. In this paper, we present a worst-case O(n3)-time algorithm for this problem, improving the previous best O(n3 log n)-time algorithm [7]. Our result requires a novel adaptive strategy for deciding how a dynamic program divides into subproblems, together with a deeper understanding of the previous algorithms for the problem. We prove the optimality of our algorithm among the family of decomposition strategy algorithms--which also includes the previous fastest algorithms--by tightening the known lower bound of Ω(n2 log2 n) [4] to O(n3), matching our algorithm's running time. Furthermore, we obtain matching upper and lower bounds of Θ(nm2(1+log n/m)) when the two trees have sizes m and n where m n.