Abstract
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.
This work is partially supported by Grand-in-Aid for Scientific Research 20500126, 21500145 and 22240010 from the Ministry of Education, Culture, Sports, Science and Technology, Japan.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bille, P.: A survey on tree edit distance and related problems. Theoret. Comput. Sci. 337, 217–239 (2005)
Fukagawa, D., Tamura, T., Takasu, A., Tomita, E., Akutsu, T.: A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures. BMC Bioinformatics 12 (2011)
Hirata, K., Yamamoto, Y., Kuboyama, T.: Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 402–415. Springer, Heidelberg (2011)
Horesh, Y., Mehr, R., Unger, R.: Designing an \(A^*\!\!\) algorithm for calculating edit distance between rooted-unordered trees. J. Comput. Bio. 13, 1165–1176 (2006)
Kailing, K., Kriegel, H.-P., Schönauer, S., Seidl, T.: Efficient Similarity Search for Hierarchical Data in Large Databases. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 676–693. Springer, Heidelberg (2004)
Shasha, D., Wang, J.T.-L., Zhang, K., Shih, F.Y.: Exact and approximate algorithms for unordered tree matching. IEEE Trans. Sys. Man and Cybernet. 24, 668–678 (1994)
Tai, K.-C.: The tree-to-tree correction problem. J. ACM 26, 422–433 (1979)
Zhang, K., Shasha, D.: Tree pattern matching. In: Apostolico, A., Galil, Z. (eds.) Pattern Matching Algorithms, pp. 341–371 (1997)
Zhang, K., Jiang, T.: Some MAX SNP-hard results concerning unordered labeled trees. Inform. Process. Lett. 49, 249–254 (1994)
Zhang, K., Statman, R., Shasha, D.: On the editing distance between unordered labeled trees. Inform. Process. Lett. 42, 133–139 (1992)
Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18, 1245–1262 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Higuchi, S., Kan, T., Yamamoto, Y., Hirata, K. (2012). An A* Algorithm for Computing Edit Distance between Rooted Labeled Unordered Trees. In: Okumura, M., Bekki, D., Satoh, K. (eds) New Frontiers in Artificial Intelligence. JSAI-isAI 2011. Lecture Notes in Computer Science(), vol 7258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32090-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-32090-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32089-7
Online ISBN: 978-3-642-32090-3
eBook Packages: Computer ScienceComputer Science (R0)