Abstract
A considerable amount of work has been done on sequence comparison for problems such as string correction, molecular biology, human speech, codes and error control, and so on[l]. Tree metrics have been also studied[3-14 ]. Potential applications of tree metric include the areas of behavioral science[3], data base[5], clustering[7], waveform correlation[9], and so on. Among various tree metrics, Tai’s metric[6] seems to be the most fundamental one. Selkow’s metric[4] is a strictly restricted Tai’s metric. Between these two metrics, several metrics have been defined[10-12]. However, the interrelation between these metrics is not known clearly. In this paper, by introducing a concept “the nearest ancestor determined by a mapping”, we give a unified point of view for tree metrics. Furthermore, we propose a new similarity between two trees.
This is a preview of subscription content, log in via an institution to check access.
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
J.B. Kruskal, “An overview of sequence comparison: Time warps, string edits, and macromolecules,” SIAM Review vol.25, no.2, pp.201–237, (1983)
T. Okuda, E. Tanaka and T. Kasai, “A method for the correction of garbled words based on the Levenshtein metric,” IEEE Trans. Com., vol.C-25, no.2, pp.172–178, (1976)
S. A. Boorman and D. Oliver, “Metrics on spaces of finite trees,” J.Math.Psychology, vol.10, pp.26–59, (1973)
S. M. Selkow, “The tree-to-tree editing problem,” Inf.Proc. Letters, vol.6, no.6, pp.184–186, (1977)
S. Yamasaki and T. Nishida, “On the metric between tree structures,” (in Japanese) Annual meeting of IECE Japan, pp.1107, (1977)
K. C. Tai, “The tree-to-tree correction problem,” JACM, vol.26, no.3, pp.422–433, (1979)
S. Y. Lu, “A tree-to-tree distance and its application to cluster analysis,” IEEE Trans.PAMI, vol.PAMI-1, no.2, pp.219–224, (1979)
S. Y. Lu, “A tree-matching algorithm based node splitting and Merging,” IEEE Trans.PAMI, vol.PAMI-6, no.2, pp.249–256,(1984)
Y. C. Cheng and S. Y. Lu, “Waveform correlation by tree matching,” IEEE Trans.PAMI, vol.PAMI-7, no.3, pp.299–305, (1985)
E. Tanaka and K. Tanaka, “A metric on trees and its computing method,” (in Japanese) Trans.IECE, vol.65, no.5, pp.511–518, (1982)
E. Tanaka, “The metric between trees based on the strongly structure preserving mapping and its computing method,” (in Japanese) Trans.IECE, vol.67, no.6, pp.722–723,(1984)
K. Nakabayashi and K. Kamata, “A distance between two binary trees and its computing algorithm,” (in Japanese) Trans. IECE, vol.J66-D, no.4, pp.445–451,(1983)
E. Tanaka, “A computing algorithm for the tree metric based on the structure preserving mapping,” Trans. IECE, vol.E68, no.5, pp.317–324, (1985)
E. Tanaka, “Efficient computing algorithm for the Tai metric,” Proc. International Computer Symposium 1986, Tainan, Taiwan.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ohmori, K., Tanaka, E. (1988). A Unified View on Tree Metrics. In: Ferraté, G., Pavlidis, T., Sanfeliu, A., Bunke, H. (eds) Syntactic and Structural Pattern Recognition. NATO ASI Series, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83462-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-83462-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83464-6
Online ISBN: 978-3-642-83462-2
eBook Packages: Springer Book Archive