Abstract
The problem of comparing two tree structures emerges across a wide range of applications in computational biology, pattern recognition, and many others. A number of tree edit methods have been proposed to find a structural similarity between trees. The alignment of trees is one of these methods, introduced as a natural extension of the alignment of strings, which gives a common supertree pattern of two trees, whereas tree edit gives a common subtree pattern. It is well known that alignment and edit are two equivalent notions for strings from the computational point of view. This equivalence, however, does not hold for trees. The lack of a theoretical formulation of these notions has lead to confusion. In this paper, we give a theoretical analysis of alignment and edit methods, and show an important relationship, which is the equivalence between the the alignment of trees and a variant of tree edit, called less-constrained edit.
This work is partly supported by Grant-in-Aid for Scientific Research No. 17700138, and No. 16016275 from the Ministry of Education, Culture, Sports, Science and Technology, Japan.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sakakibara, Y.: Pair hidden markov models on tree structures. Bioinformatics 19, 232–240 (2003)
Torsello, A., Hancock, E.R.: Matching and embedding through edit-union of trees. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol. 2352, pp. 822–836. Springer, Heidelberg (2002)
Ferraro, P., Godin, C.: A distance measure between plant architectures. Annals of Forest Science 57, 445–461 (2000)
Hogue, A., Karger, D.: Thresher: Automating the unwrapping of semantic content from the world wide web. In: Proc. of WWW 2005, pp. 86–95 (2005)
Tai, K.-C.: The tree-to-tree correction problem. Journal of the ACM 26(3), 422–433 (1979)
Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SICOMP 18(6), 1245–1262 (1989)
Jiang, T., Wang, L., Zhang, K.: Alignment of trees — an alternative to tree edit. Theoretical Computer Science 143, 137–148 (1995)
Wagner, R., Fischer, M.: The string-to-string correction problem. Journal of the ACM 21, 168–173 (1974)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)
Bille, P.: A survey on tree edit distance and related problems. Theoretical Computer Science 337, 217–239 (2005)
Lu, C.L., Su, Z.Y., Tang, G.Y.: A new measure of edit distance between labeled trees. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 338–348. Springer, Heidelberg (2001)
Zhang, K.: A constrained edit distance between unordered labeled trees. Algorithmica 15, 205–222 (1996)
Zhang, K.: Algorithms for the constrained editing distance between ordered labeled trees and related problems. Pattern Recognition 28(3), 463–474 (1995)
Tanaka, E., Tanaka, K.: The tree-to-tree editing problem. International Journal of Pattern Recognition and Artificial Intelligence 2, 221–240 (1988)
Richter, T.: A new measure of the distance between ordered trees and its applications. Technical Report 85166-CS, Dept. of Computer Science, Univ. of Bonn (1997)
Wang, J.L., Zhang, K.: Finding similar consensus between trees: an algorithm and a distance hierarchy. Pattern Recognition 34, 127–137 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuboyama, T., Shin, K., Miyahara, T., Yasuda, H. (2005). A Theoretical Analysis of Alignment and Edit Problems for Trees. In: Coppo, M., Lodi, E., Pinna, G.M. (eds) Theoretical Computer Science. ICTCS 2005. Lecture Notes in Computer Science, vol 3701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560586_26
Download citation
DOI: https://doi.org/10.1007/11560586_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29106-0
Online ISBN: 978-3-540-32024-1
eBook Packages: Computer ScienceComputer Science (R0)