The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
The NP-hard maximum rooted resolved triplets consistency problem (MRTC) takes as input a set [Formula presented] of leaf labels and a set [Formula presented] of resolved triplets over [Formula presented] and asks for a rooted phylogenetic tree that is consistent with the maximum number of elements in [Formula presented]. This article studies the approximability of a generalization of the problem c
