World Scientific
  • Search
  •   
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD

    https://doi.org/10.1142/S0129054100000363Cited by:3 (Source: Crossref)

    The Maximum Isomorphic Agreement Subtree problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method which is used to compare phylogenies. More precisely allows to provide a subset of the species such that the exact distances between species in such subset are preserved among all evolutionary trees considered. In this paper, the approximation complexity of the MIT problem is investigated, showing that it cannot be approximated in polynomial time within factor logδn for any δ > 0 unless NPDTIME(2polylog n) for instances containing three trees. Moreover, we show that such result can be strengthened whenever instances of the problem can contain an arbitrary number of trees, since shares the same approximation lower bound of .

    Remember to check out the Most Cited Articles!

    Check out these Handbooks in Computer Science