The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

The complexity of inferring a minimally resolved phylogenetic supertree

På svenska

Author

Summary, in English

A recursive algorithm by Aho et al. [SIAM J. Comput., 10 (1981), pp. 405-421] forms the basis for many modern rooted supertree methods employed in Phylogenetics. However, as observed by Bryant [Building Trees, Hunting for Trees, and Comparing Trees: Theory and Methods in Phylogenetic Analysis, Ph.D. thesis, University of Canterbury, Christchurch, New Zealand, 1997], the tree output by the algorithm of Aho et al. is not always minimal; there may exist other trees which contain fewer nodes yet are still consistent with the input. In this paper, we prove strong polynomial-time inapproximability results for the problem of inferring a minimally resolved supertree from a given consistent set of rooted triplets (MINRS). Furthermore, we show that the decision version of MINRS is NP-hard for any fixed positive integer q >= 4, where q is the number of allowed internal nodes, but linear-time solvable for q <= 3. In contrast, MINRS becomes polynomial-time solvable for any q when restricted to caterpillars. We also present an exponential-time algorithm based on tree separators for solving MINRS exactly. It runs in 2(O(n log p)) time when every node may have at most p children that are internal nodes and where n is the cardinality of the leaf label set. Finally, we demonstrate that augmenting the algorithm of Aho et al. with an algorithm for optimal graph coloring to help merge certain blocks of leaves during the execution does not improve the output solution much in the worst case.

Department/s

  • Computer Science

Publishing year

2012

Language

English

Pages

272-291

Publication/Series

SIAM Journal on Computing

Volume

41

Issue

1

Document type

Journal article

Publisher

Society for Industrial and Applied Mathematics

Topic

  • Computer Science

Keywords

  • tree separator
  • graph coloring
  • NP-hardness
  • minimally resolved supertree
  • rooted triplet
  • phylogenetic tree

Status

Published

ISBN/ISSN/Other

  • ISSN: 0097-5397