论文信息 - An A* Algorithm for Computing Edit Distance between Rooted Labeled Unordered Trees

An A* Algorithm for Computing Edit Distance between Rooted Labeled Unordered Trees

In this paper, we design an A* algorithm for computing the edit distance between rooted labeled unordered trees. First, we introduce some lower bounding functions that provide the constant factor lower bounds on the edit distance. Then, by using the lower bounding functions as a heuristic function, we design the A* algorithm as the best-first search for the edit distance search tree. Finally, we give experimental results for the A* algorithm.

Kouichi Hirata | Shoichi Higuchi | Yoshiyuki Yamamoto | Tomohiro Kan

[1] Hans-Peter Kriegel,et al. Efficient Similarity Search for Hierarchical Data in Large Databases , 2004, EDBT.

[2] Kaizhong Zhang,et al. Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems , 1989, SIAM J. Comput..

[3] Yair Horesh,et al. Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees , 2006, J. Comput. Biol..

[4] Kouichi Hirata,et al. Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees , 2011, CPM.

[5] Kaizhong Zhang,et al. Tree pattern matching , 1997, Pattern Matching Algorithms.

[6] Kaizhong Zhang,et al. Exact and approximate algorithms for unordered tree matching , 1994, IEEE Trans. Syst. Man Cybern..

[7] Tao Jiang,et al. Some MAX SNP-Hard Results Concerning Unordered Labeled Trees , 1994, Inf. Process. Lett..

[8] Kuo-Chung Tai,et al. The Tree-to-Tree Correction Problem , 1979, JACM.

[9] Kaizhong Zhang,et al. On the Editing Distance Between Unordered Labeled Trees , 1992, Inf. Process. Lett..

[10] Jan Chomicki,et al. Hippo: A System for Computing Consistent Answers to a Class of SQL Queries , 2004, EDBT.

[11] Philip Bille,et al. A survey on tree edit distance and related problems , 2005, Theor. Comput. Sci..

[12] Atsuhiro Takasu,et al. A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures , 2011, BMC Bioinformatics.