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

This paper considers the approximability of the largest common subtree and the largest common subgraph problems, which have applications in molecular biology. It is shown that approximating the problems within a factor of ne is NP-complete, while a general search algorithm which approximates both problems within a factor of O(n/log n) is presented. Moreover, several variants of the largest common subtree problem are studied.

[1]  Tao Jiang,et al.  Some MAX SNP-Hard Results Concerning Unordered Labeled Trees , 1994, Inf. Process. Lett..

[2]  C. Sander,et al.  Detection of common three‐dimensional substructures in proteins , 1991, Proteins.

[3]  Tao Jiang,et al.  On the Approximation of Shortest Common Supersequences and Longest Common Subsequences , 1994, SIAM J. Comput..

[4]  Tatsuya Akutsu.  On Determining the Congruity of Point Sets in Higher Dimensions , 1994, ISAAC.

[5]  Magnús M. Halldórsson,et al.  A Still Better Performance Guarantee for Approximate Graph Coloring , 1993, Information Processing Letters.

[6]  G. Barton,et al.  Multiple protein sequence alignment from tertiary structure comparison: Assignment of global and residue confidence levels , 1992, Proteins.

[7]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[8]  Tatsuya Akutsu.  An RNC Algorithm for Finding a Largest Common Subtree of Two Trees , 1992 .

[9]  F. F. Yao,et al.  Approximation Algorithms for the Largest Common Subtree Problem. , 1995 .

[10]  J. J. McGregor,et al.  Backtrack search algorithms and the maximal common subgraph problem , 1982, Softw. Pract. Exp..

[11]  Magnús M. Hallórsson.  A still better performance guarantee for approximate graph coloring , 1993 .

[12]  Steven W. Reyner,et al.  An Analysis of a Good Algorithm for the Subtree Problem , 1977, SIAM J. Comput..

[13]  C. Branden,et al.  Introduction to protein structure , 1991 .

[14]  Kurt Mehlhorn,et al.  Congruence, similarity, and symmetries of geometric objects , 1987, SCG '87.

[15]  David Maier,et al.  The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.

[16]  Susan Anderson,et al.  Graphical representation of molecules and substructure-search queries in MACCStm , 1984 .

[17]  T. Akutsu.  A Polynomial Time Algorithm for Finding a Largest Common Subgraph of almost Trees of Bounded Degree , 1993 .

[18]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[19]  Yoshimasa Takahashi,et al.  Recognition of Largest Common Structural Fragment among a Variety of Chemical Structures , 1987 .

[20]  Robert E. Stobaugh.  Chemical substructure searching , 1985, J. Chem. Inf. Comput. Sci..