Abstract
This paper considers the approximability of the largest common subtree and the largest common point-set problems, which have applications in molecular biology. It is shown that the problems cannot be approximated within a factor of n 1−ε in polynomial time for any ε>0 unless NP ⊆ ZPP , while a general search algorithm which approximates both problems within a factor of O(n/ logn) is presented. For trees of bounded degree, an improved algorithm which approximates the largest common subtree within a factor of O(n/ log 2n) is presented. Moreover, several variants of the largest common subtree problem are studied.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
