Constructing evolutionary trees from rooted triples

Abstract

In this paper, we propose a new heuristic algorithm for the maximum consensus tree of rooted triples. By the experimental results, we show that the algorithm is better than the three previous heuristics and runs in reasonable time. Furthermore, by the algorithm, it is possible to make trade-off between the running time and the quality of the solution. We also investigated the computational complexity of the maximum compatible set problem. We show that it is NP-hard to find the maximum vertex set compatible with given rooted triples.