Metrics between trees embedded in a plane and their computing methods

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E79-A, Issue 4, 1996, Pages 441-447

  Tanaka, Eiichi ^a  

^a KOBE UNIVERSITY   (Japan)

Author keywords

Distance; Dynamic programming; Pattern matching; Pattern recognition; Similar structure search; Similarity; Tree

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; CONFORMAL MAPPING; DYNAMIC PROGRAMMING; GRAPH THEORY; PATTERN RECOGNITION;

CYCLICALLY ORDERED TREES; DISTANCE; PATTERN MATCHING; SIMILAR STRUCTURE SEARCH; SIMILARITY;

TREES (MATHEMATICS);

EID: 0030123602     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. S.M. SelkowTree-to-tree editing problem Inf. Process. Lett., vol.6, pp.184-186, 1977.
2. K.C. TaiThe tree-to-tree correcting problem JACM, vol.26, pp.422-433, 1979.
3. K. AokiAn algorithm of computing the distance of Tai between two labeled trees Trans. IECE (Jpn), vol.J66-D, pp.49-56, 1983.
4. E. TanakaA bottom-up computing method for the metric between trees defined by Tai Trans. IECE (Jpn), vol.J66-D, pp.660-667, 1983.
5. E. TanakaEfficient computing algorithms for the Tai metric Proc. International Computer Symposium 1986, pp.1330-1337, 1986.
6. K. Ohmori and E. TanakaA unified view on tree metrics Proc. of Workshop on Syntactic and Structural Pattern Recognition, pp.85-100, 1986.
7. S.Y. LuA tree-to-tree distance and its application to cluster IEEE Trans. PAMI, vol.1, pp.219-224, 1979.
8. E. Tanaka and K. Tanaka(a) A metric on trees and its computing method Trans. IECE (Jpn), voI.J65-D, pp.511-518, 1982. (b) Correction to 'A metric on trees and its computing method,' IEICE Trans. vol.J76-D-I, p.635, 1993.
9. E. TanakaA computing algorithm for the tree metric based on the structure preserving mapping Trans. IECE (Jpn), vol.E68, pp.317-324, 1985.
10. (a) E. Tanaka and K. TanakaThe tree-to-tree editing problem International Journal of Pattern Recognition and Artificial Intelligence, vol.2, pp.221-240, 1988.
11. (b) E. TanakaA note on a tree-to-tree editing problem ibid, vol.9, pp. 167-172, 1995.
12. E. TanakaThe metric between trees based on the strongly structure preserving mapping and its computing method Trans. IECE (Jpn), vol.J67-D, pp.722-723, 1984.
13. S.Y. LuA tree-matching algorithm based on node splitting and merging IEEE Trans. PAMI, vol.6, pp.249-256, 1984.
14. Y.C. Cheng and S.Y. LuWaveform correlation by tree matching IEEE Trans. PA-MI, vol.7, pp.299-305, 1985.
15. D. Shasha and K. ZhangFast algorithms for the unit cost editing distance between trees J. Algorithms; vol.11, pp.581-621, 1990.
16. K. Culik II and D. WoodA note on some tree similarity measures Inf. Process. Lett., vol.15, pp.39-42, 1982.
17. E. TanakaA metric between unrooted and unordered trees and its computing meth-od IEEE Trans. PAMI, vol.16, pp.1233-1238, 1994.
18. K. Zhang, R. Statman, and S. ShashaOn the editing distance between unordered labeled trees Inf. Process. Lett., vol.42, pp. 133-139, 1992.
19. T. KomotoA study on an application of a tree metric Bachelor's thesis, Department of Electronics Engineering, Kobe Univ., 1994.
20. S.M. Liu, E. Tanaka, and S. MasudaThe distances between unrooted and cyclically ordered trees and their computing methods IEICE Trans. Inf. and Syst., vol.E77-D, pp. 1094-1105, 1994.
21. S.M. Liu and E. TanakaA largest common similar substructure problem for trees embedded in a plane IEICE Technical Report on Computation, COMP 95-74, pp. 11-20, 1996.