Supertree methods allow to reconstruct large phylogenetic trees by combining smaller trees with overlapping leaf sets into one,\r\nmore comprehensive supertree. The most commonly used supertree method, matrix representation with parsimony (MRP),\r\nproduces accurate supertrees but is rather slow due to the underlying hard optimization problem. In this paper, we present an\r\nextensive simulation study comparing the performance of MRP and the polynomial supertree methodsMinCut Supertree,Modified\r\nMinCut Supertree, Build-with-distances, PhySIC, PhySIC IST, and super distance matrix.We consider both quality and resolution of\r\nthe reconstructed supertrees. Our findings illustrate the tradeoff between accuracy and running time in supertree construction, as\r\nwell as the pros and cons of voting- and veto-based supertree approaches. Based on our results, we make some general suggestions\r\nfor supertree methods yet to come.
Loading....