Author:
Augsten Nikolaus,Böhlen Michael H.
Publisher
Morgan & Claypool Publishers LLC
Reference63 articles.
1. Exact algorithms for computing the tree edit distance between unordered trees
2. Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees
3. Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
4. Shurug Al-Khalifa, H. V. Jagadish, Jignesh M. Patel, Yuqing Wu, Nick Koudas, and Divesh Srivastava. Structural joins: A primitive for efficient XML query pattern matching. InProc. 18th Int. Conf. on Data Engineering, pages141-152, 2002. DOI: 10.1109/ICDE.2002.994704.10.1109/ICDE.2002.994704
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献