On the approximation of largest common subtrees and largest common point sets

Theoretical Computer Science

Volumn 233, Issue 1-2, 2000, Pages 33-50

  Akutsu, Tatsuya ^a   Halldórsson, Magnús M ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b UNIVERSITY OF ICELAND   (Iceland)

Author keywords

Approximation algorithms; Common point set; Common subtree; Computational biology

Indexed keywords

EID: 0142236211     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00278-8     Document Type: Article

References (17)

1. T. Akutsu, An RNC algorithm for finding a largest common subtree of two trees, IEICE Trans. Inform. Systems E75-D (1992) 95-101.
2. T. Akutsu, A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree, IEICE Trans. Fundam. Electron. Comm. Comput. Sci. E76-A (1993) 1488-1493.
3. T. Akutsu, M.M. Halldórsson, On the approximation of largest common point sets and largest common subtrees, in: Proc. 5th Internat. Symp. on Algorithms and Computation, Lecture Notes in Computer Science, vol. 834, Springer, Berlin, 1994, pp. 405-413.
4. H. Alt, K. Melhorn, H. Wagener, E. Welzl, Congruence, similarity, and symmetries of geometric objects, Discrete Comput. Geometry 3 (1988) 237-256.
5. S. Anderson, Graphical representation of molecules and substructure-search queries in MACCS, J. Molecular Graphics 2 (1984) 8-90.
6. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, New York, 1979.
7. 1-ε, in: Proc. 37th IEEE Symp. on Foundations of Comput. Sci., 1996, pp. 627-636.
8. T. Jiang, M. Li, On the approximation of shortest common supersequences and longest common subsequences, SIAM J. Comput. 24 (1995) 1122-1139.
9. D. Keselman, A. Amir, Maximum agreement of subtree in a set of evolutionary trees - metrics and efficient algorithms, in: Proc. 35th IEEE Symp. on Foundations of Comput. Sci., 1994, pp. 758-769.
10. S. Khanna, R. Motwani, F.F. Yao, Approximation algorithms for the largest common subtree problem, Tech. Rep., Stanford University, 1995.
11. J.J. Mcgregor, Backtrack search algorithms and the maximal common subgraph problem, Software-Practice Experience 12 (1982) 23-34.
12. R. Maier, The complexity of some problems on subsequences and supersequences, J. ACM 25 (1978) 322-336.
13. S.W. Reyner, An analysis of a good algorithm for the subtree problems, SIAM J. Comput. 6 (1977) 730-732.
14. R.B. Russel, G.J. Barton, Multiple protein sequence alignment from tertiary structure comparison: assignment of global and residue confidence levels, PROTEINS: Structure, Function Genetics 14 (1992) 309-323.
15. R.E. Stobaugh, Chemical substructure searching, J. Chem. Inform. Comput. Sci. 25 (1985) 271-275.
16. Y. Takahashi, Y. Satoh, H. Suzuki, S. Sasaki, Recognition of largest common structural fragment among a variety of chemical structures, Analyt. Sci. 3 (1987) 23-28.
17. G. Vriend, C. Sander, Detection of common three-dimensional substructures in proteins, PROTEINS: Structure Function Genetics 11 (1991) 52-58.