Efficient algorithms for finding largest similar substructures in unordered trees

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E79-A, Issue 4, 1996, Pages 428-440

  Liu, Shaoming ^a   Tanaka, Eiichi ^a  

^a KOBE UNIVERSITY   (Japan)

Author keywords

Algorithm; Complexity; Distance; Similar structure; Tree

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; GRAPH THEORY; TREES (MATHEMATICS);

DISTANCE; SIMILAR STRUCTURE; UNORDERED TREES;

ALGORITHMS;

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

References (21)

1. P. WillettSimilarity and clustering in chemical information systems Research Studies Press, 1987.
2. K.J. Lipscomb, M.F. Lynch, and P. WillettChemical structure processing Ann. Rev. Inf. Sci. Technol., vol.24, pp. 189-238, 1989.
3. G. Klopman and A.N. KalosQuantitative 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.
4. H.M. Grindley, P.J. Artymiuk, D.W. Rice, and P. WillettIdentification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm J. Mol. Biol., vol.229, pp.707-721, 1993.
5. M.G. Hicks and C. JochumSubstructure 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.
6. H. Maehara, E. Tanaka, and M.IkedaA method for extraction of similar substructures in plural graphs Proc. 18th Symposium of Structure-activity Relation, 29S21, pp.385-388, 1990.
7. W.A. WarrChemical structures 2 Springer, 1993.
8. S.M. Liu, E. Tanaka, and S. MasudaLargest similar substructure problems for trees and their algorithms IEICE Trans., vol.J78-A, no.10, pp.1348-1357, Oct. 1995.
9. S.M. Liu and E. TanakaLargest similar substructure problems for unordered trees Inf. Process. Soc.(Jan) SIG Notes, 95-AL-48, pp.23-30, 1995.
10. K.C. TaiThe tree-to-tree correction problem JACM, vol.26, no.3, pp.422-433, 1979.
11. E. Tanaka and K. Tanaka, (a) A tree metric and its computing method IECE Trans., vol.J65-D, no.5, pp.511-518, 1982.
12. (b) Correction to A tree metric and its computing method IEICE Trans., vol.J76-D-I, no.11, p.635, 1993.
13. E. TanakaThe metric between rooted and ordered trees based on strongly structure preserving mapping and its computing method IECE Trans., vol.J67-D, no.6, pp.722-723, 1984.
14. K. Ohmori and E. TanakaA 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. MasudaThe 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. T. Muguruma, E. Tanaka, and S. MasudaA 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.
17. ['6] E. TanakaA 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, 1994.
18. S.M. Liu and E. TanakaAlgorithms for computing the distances between unordered trees IEICE Trans., vol.J78-A, no.10, pp.1358-1371, Oct. 1995.
19. K.Z. Zhang, D. Shasha, and J.T.L. WangApproximate tree matching in the presence of variable length don't cares J. Algorithm, vol.16, pp.33-66, 1994.
20. K. Zhang, R. Statman, and D. ShashaOn the editing distance between unordered labeled trees Inf. Process. Lett., vol.42, pp. 133-139, 1992.
21. E.L. LawlerCombinatorial Optimization: Networks and Matroids Holt Rinehalt and Winston, New York, NY, 1976.