Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Comparing Hierarchical Data in External Memory
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Pure Multiple RNA Secondary Structure Alignments: A Progressive Profile Approach
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Comparing similar ordered trees in linear-time
Journal of Discrete Algorithms
Matching XML documents in highly dynamic applications
Proceedings of the eighth ACM symposium on Document engineering
Decomposition Method for Tree Kernels
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks
An optimal decomposition algorithm for tree edit distance
ACM Transactions on Algorithms (TALG)
A linear tree edit distance algorithm for similar ordered trees
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
XML information retrieval through tree edit distance and structural summaries
AIRS'11 Proceedings of the 7th Asia conference on Information Retrieval Technology
Similarity join on XML based on k-generation set distance
WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
An optimal decomposition algorithm for tree edit distance
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
DTD based costs for tree-edit distance in structured information retrieval
ECIR'13 Proceedings of the 35th European conference on Advances in Information Retrieval
Indexing for subtree similarity-search using edit distance
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
RWS-Diff: flexible and efficient change detection in hierarchical data
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.01 |
In 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.