The largest common similar substructure problem

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E80-A, Issue 4, 1997, Pages 643-650

  Liu, Shaoming ^a   Tanaka, Eiichi ^a  

^a KOBE UNIVERSITY   (Japan)

Author keywords

Algorithm; Common similar substructure; Complexity; Distance; Similarity; Tree

Indexed keywords

ALGORITHMS; NUMBER THEORY; PATTERN RECOGNITION; STRUCTURAL ANALYSIS; STRUCTURE (COMPOSITION);

COMMON SIMILAR SUBSTRUCTURES;

TREES (MATHEMATICS);

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

References (36)

1. J. Köbler, U. Schöning, and J. Toran, The Graph Isomorphism Problem: Its Structural Complexity, Birkhäuser, 1993.
2. J.R. Ullman, An algorithm for subgraph isomorphism, JACM, vol.23, pp.31-42, 1976.
3. D.M. Bayada, R.W. Simpson, and A.P. Johnson, An algorithm for the multiple common subgraph problem, J. Chem. Inf. Comput. Sci., vol.32, pp.680-685, 1992.
4. K.S. Fu, Syntactic Methods in Pattern Recognition, New York, Academic, 1974.
5. V.I. Levenshtein, Binary codes capable of correcting deletions, insertions, and reversals, Cybernetics and Control Theory, vol.10, pp.707-710, 1966.
6. R.A. Wagner and M.J. Fischer, The string-to-string correction problem, JACM, vol.21, pp.168-173,1974.
7. T. Okuda, E. Tanaka, and T. Kasai, A method for the correction of garbled words based on the Levenshtein metric, IEEE Trans. Comput., vol.C-25, pp.172-177, 1976.
8. S.M. Selkow, Tree-to-tree editing problem, Inf. Process. Lett., vol.6, pp. 184-186, 1977.
9. K.C. Tai, The tree-to-tree correction problem, JACM, vol.26, no.3, pp.422-433, 1979.
10. S.Y. Lu, A tree-to-tree distance and its application to cluster analysis, IEEE Trans. Pattern Anal. & Mach. Intell., vol.PAMI-1, no.2, pp.219-224, 1979.
11. E. Tanaka and K. Tanaka, (a) A metric on trees and its computing method, IECE Trans., vol.J65-D, no.5, pp.511-518, 1982.
12. (b) Correction to 'A metric on trees and its computing method', IEICE Trans., vol.J76-D-1, no.11, p.635, 1993.
13. E. Tanaka, The metric between trees based on the strongly structure preserving mapping and its computing method, IECE Trans., vol.J67-D, no.6, pp.722-723, 1984.
14. K. Ohmori and E. Tanaka, A unified view on tree metrics, Proc. Workshop on Syntactic and Structural Pattern Recognition, Barcelona, pp.85-100, 1986. (Eds. G.Ferraté et al. Syntactic and Structural Pattern Recognition, Springer 1988.)
15. S.M. Liu, E. Tanaka, and S. Masuda, The distances between unrooted and cyclically ordered trees and their computing methods, IEICE Trans. Inf. & Syst., vol.E77-D, no.10, pp.1094-1105, Oct. 1994.
16. E. Tanaka, Metrics between trees embedded in a plane and their computing methods, IEICE Trans. Fundamentals, vol.E79-A, no.4, pp.441-440, April 1996.
17. R. Wilhelm, A modified tree-to-tree correction problem, Inf. Process. Lett., vol.12, pp.127-132, 1981.
18. K. Zhang, R. Statman, and D. Shasha, On the editing distance between unordered labeled trees, Inf. Process. Lett., vol.42, pp.133-139, 1992.
19. T. Muguruma, E. Tanaka, and S. Masuda, A metric between unrooted and unordered trees and its top-down computing method, IEICE Trans. Inf. & Syst., vol.E77-D, no.5, pp.555-566, May 1994.
20. E. Tanaka, A metric between unrooted and unordered trees and its bottom-up computing method, IEEE Trans. Pattern Anal. & Mach. Intell., vol.16, no.12, pp.1233-1238, Dec. 1994.
21. S.M. Liu and E. Tanaka, Algorithms for computing the distances between unordered trees, IEICE Trans., vol.J78-A, no.10, pp.1358-1371, Oct. 1995.
22. G. Klopman and A.N. Kalos, Quantitative structure-activity relationships of beta-adrenergic agents. Application of the computer automated structure evaluaton (CASE) technique of molecular fragment recognition, J. Theor. Biol., vol.118, pp.199-214, 1986.
23. H.M. Grindley, P.J. Artymiuk, D.W. Rice, and P. Willett, Identification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm, J. Mol. Biol., vol.229, pp.707-721, 1993.
24. P. Willett, Similarity and Clustering in Chemical Information Systems, Research Studies Press, 1987.
25. T. Akutsu, A polynomial time algorithm for subgraph isomorphism of tree-like graphs, Inf. Process. Soc. (Jan) SIG Notes, 90-AL-17, pp.7-13, 1990.
26. J. Ash, P.A. Chubb, S.E. Ward, S.M. Welford, and P. Willet, Communication, Storage and Retrieval of Chemical Information, Ellis Horwood, 1991.
27. R. Attias, Substructure Systems and Structural Retrieval Systems, in Encyclopedia of Library and Information Science, ed. A. Kent, Marcel Dekker Inc., 1992.
28. S. Masuda, I. Mori, and E. Tanaka, Algorithms for finding the largest common subgraphs of two trees, IEICE Trans., vol.J77-A, no.3, pp.460-470, 1994.
29. H. Maehara, E. Tanaka, and M. Ikeda, A method for extraction of similar substructures in plural graphs, Proc. 18th Symposium on Structure-activity Relationships, 29S21, pp.385-388, 1990.
30. S.M. Liu, E. Tanaka, and S. Masuda, Largest similar substructure problems for trees and their algorithms, IEICE Trans., vol.J78-A, no.10, pp.1348-1357, Oct. 1995.
31. S.M. Liu and E. Tanaka, Efficient algorithms for finding largest similar substructures in unordered trees, IEICE Trans. Fundamentals, vol.E79-A, no.4, pp.428-440, April 1996.
32. W.A. Warr, Chemical Structures 2, Springer, 1993.
33. S.M. Liu and E. Tanaka, Largest common similar substructures of rooted and unordered trees, Record of the Kansai-Section Joint Convention of Institutes of Electrical Engineering, Japan, G12-4, p.294, Nov. 1995.
34. S.M. Liu and E. Tanaka, Largest common similar substructures of rooted and unordered trees, Mem. Grad. School Sci. & Technol., Kobe Univ., 14-A, pp.107-119, 1996.
35. S.M. Liu and E. Tanaka, Several similarity problems between unordered trees, Inf. Process. Soc. (Jpn) SIG Notes, 96-AL-51, pp.49-56, May 1996.
36. S.M. Liu and E. Tanaka, A largest common similar substructure problem for trees embedded in a plane, IEICE Technical Report, COMP 95-74, pp.11-20, Jan. 1996.