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 nε 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.
CITATION STYLE
Akutsu, T., & Halldórsson, M. M. (1994). On the approximation of largest common subtrees and largest common point sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 405–413). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_205
Mendeley helps you to discover research relevant for your work.