Triplet-Supertrees constructed from Minimum Triplet Presentations

摘要

Supertree methods are a popular approach to build large-scale phylogenetic trees. Triplet-based supertree methods have desirable properties and appear to perform well; however, the enormous number of triplets ultimately limits their use for building large supertrees. We apply and extend an approach for the generation of sets of triplets proposed by Grunewald et al. which greatly reduces the number of triplets used to identify a tree [8]. We evaluate different reduced sets of triplets with recent supertree construction methods on simulated and empirical data sets. The reduction of the triplet set cardinality and the performance of the reduced sets are promising and can compete with the performance of full triplet supertree constructions.