The NP-hard maximum rooted resolved triplets consistency problem (MRTC) takes as input a set S of leaf labels and a set R. of resolved triplets over S and asks for a rooted phylogenetic tree that is consistent with th...
详细信息
The NP-hard maximum rooted resolved triplets consistency problem (MRTC) takes as input a set S of leaf labels and a set R. of resolved triplets over S and asks for a rooted phylogenetic tree that is consistent with the maximum number of elements in R. This article studies the approximability of a generalization of the problem called the maximum rooted triplets consistency problem (MTC) where in addition to resolved triplets, the input may contain fan triplets, forbidden resolved triplets, and forbidden fan triplets. To begin with, we observe that MTC admits a 1/4-approximation in polynomial time. Next, we generalize Wu's exact exponential-time algorithm for MRTC (Wu, 2004) to MTC. Forcing the algorithm to always output a rooted k-ary phylogenetic tree for any specified k >= 2 subsequently leads to an exponential-time approximation scheme (ETAS) for MTC. We then present a polynomial time approximation scheme (PTAS) for complete instances of MTC (meaning that for every S'subset of S with vertical bar S'vertical bar= 3, R contains at least one rooted triplet involving the leaf labels in S'), based on the techniques introduced by Jiang et al. (2001) for a related problem. We also study the computational complexity of MTC restricted to fan triplets and forbidden fan triplets. Finally, extensions to weighted instances are considered. (C) 2018 Elsevier B.V. All rights reserved.
暂无评论