Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
New algorithm for ordered tree-to-tree correction problem
Journal of Algorithms
Information Retrieval
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Computing the Edit-Distance between Unrooted Ordered Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
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
Approximate matching of hierarchical data using pq-grams
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A survey on tree edit distance and related problems
Theoretical Computer Science
A relation between edit distance for ordered trees and edit distance for Euler strings
Information Processing Letters
Approximate Joins for Data-Centric XML
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
The pq-gram distance between ordered labeled trees
ACM Transactions on Database Systems (TODS)
Approximate joins for XML using g-string
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Approximating tree edit distance through string edit distance
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
An optimal decomposition algorithm for tree edit distance
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |