In phylogenetics, the consensus problem consists in summarizing a set of phylogenetic trees that all classify the same set of species into a single tree. Several definition of consensus exists in the literature; in this paper we focus on the Weighted Quartet Consensus problem, a problem with unknown complexity status. Here we prove that the Weighted Quartet Consensus problem is NP-hard and we give several results on the approximability and fixed-parameter tractability of this problem.
['Manuel Lafond', 'Céline Scornavacca']
On the Weighted Quartet Consensus problem