A Metric between Unrooted and Unordered Trees and its Bottom-Up Computing Method

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 16, Issue 12, 1994, Pages 1233-1238

  Tanaka, Eiichi ^a  

^a KOBE UNIVERSITY   (Japan)

Author keywords

Distanco; dynamic programming; pattern matching; pattern recognition; similar structure search; similarity; tree

Indexed keywords

EID: 0346439078     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.387483     Document Type: Article

References (18)

1. S. M. Selkow, “Tree-to-tree editing problem,” Inf. Process. Lett., vol. 6, pp. 184–186, 1977.
2. K. C. Tai, “The tree-to-tree correcting problem,” J. ACM, vol. 26, pp. 422–433, 1979.
3. S. Y. Lu, “A tree-to-tree distance and its application to cluster analysis,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-1, pp. 219–224, 1979.
4. (a) E. Tanaka and K. Tanaka, “A metric on trees and its computing method,” Trans. IECE, vol. J65-D, pp. 511–518, 1982. (b) Correction to “A metric on trees and its computing method,” Trans. IEICE, vol. J76-D-I, p. 635, 1993.
5. D. Shasha and K. Zhang, “Fast algorithms for the unit cost editing distance between trees,” J. Algorithms, vol. 11, pp. 581–621, 1990.
6. S. Y. Lu, “A tree-matching algorithm based on node splitting and merging,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-6, pp. 249–256, 1984.
7. K. Zhang, R. Statman, and S. Shasha, “On the editing distance between unordered labeled trees,” Inf. Process. Lett., vol. 42, pp. 133–139, 1992.
8. W. H. Tsai and K. S. Fu, “Error-correcting isomorphisms of attributed relational graphs for pattern analysis,” IEEE Trans. Syst., Man, Cybern., vol. SMC-12, pp. 757–768, 1979.
9. L. G. Shapiro and R. M. Haralick, “Structural descriptions and inexact matching,” IEEE Trans. Pattern Anal. Machine Intell., vol. 3, pp. 504–519, 1981.
10. A. K. Wong, M. You, and S. C. Chang, “An algorithm for graph optimal monomorphism,” IEEE Trans. Syst., Man, Cybern., vol. 20, pp. 628–639, 1990.
11. P. Willett, Similarity and Clustering in Chemical Information Systems, Research Studies Press, 1987.
12. M. A. Johnson, “A review and examination of the mathematical spaces underlying molecurlar similarity analysis,” J. Math. Chem., vol. 3, pp. 117–145, 1989.
13. E. Sussenguth, “A graph-theoretic algorithm for matching chemical structures,” J. Chem. Doc., vol. 5, pp. 36–44, 1965.
14. Y. Takahashi, Y. Satoh, H. Suzuki, and S. Sasaki, “Recongition of largest common structural fragment among a variety of chemical structures,” Analytical Sciences, vol. 3, pp. 23–28, 1987.
15. M. G. Hicks and C. Jochum, “Substructure search system. 1. Performance comparison of the MACCS, DARC, HTSS, CAS registry MVSSS, and S4 substructure search systems,” J. Chem. Inf. Comput. Sci., vol. 30, pp. 191–199, 1990.
16. E. Tanaka, “The metric between trees based on the strongly structure preserving mapping and its computing method,” Trans. IECE, vol. J67-D, pp. 722–723, 1984.
17. E. L. Lawler, Combinatorial Optimization—Networks and Matriods. New York: Holt Rinehart and Winston, 1976.
18. T. Muguruma, E. Tanaka, and S. Masuda, “A metric between unrooted and unordered trees and its top-down computing method,” Trans. IEICE, vol. E77-D, pp. 555–566, 1994.