A simulation study was carried out to investigate the relative importance of tree topology (both balance and stemminess), evolutionary rates (constant, varying among characters, and varying among lineages), and evolutionary models in determining the accuracy with which phylogenetic trees can be estimated. The three evolutionary context models were phyletic (characters can change at each simulated time step), speciational (changes are possible only at the time of speciation into two daughter lineages), and punctuational (changes occur at the time of speciation but only in one of the daughter lineages). UPGMA clustering and maximum parsimony (“Wagner trees”) methods for estimating phylogenies were compared. All trees were based on eight recent OTUs. The three evolutionary context models were found to have the largest influence on accuracy of estimates by both methods. The next most important effect was that of the stemminess × context interaction. Maximum parsimony and UPGMA performed worst under the punctuational models. Under the phyletic model, trees with high stemminess values could be estimated more accurately and balanced trees were slightly easier to estimate than unbalanced ones. Overall, maximum parsimony yielded more accurate trees than UPGMA—but that was expected for these simulations since many more characters than OTUs were used. Our results suggest that the great majority of estimated phylogenetic trees are likely to be quite inaccurate; they underscore the inappropriateness of characterizing current phylogenetic methods as being for reconstruction rather than for estimation.

No abstract

BackgroundThe gene duplication (GD) problem seeks a species tree that implies the fewest gene duplication events across a given collection of gene trees. Solving this problem makes it possible to use large gene families with complex histories of duplication and loss to infer phylogenetic trees. However, the GD problem is NP-hard, and therefore, most analyses use heuristics that lack any performance guarantee.ResultsWe describe the first integer linear programming (ILP) formulation to solve instances of the gene duplication problem exactly. With simulations, we demonstrate that the ILP solution can solve problem instances with up to 14 taxa. Furthermore, we apply the new ILP solution to solve the gene duplication problem for the seed plant phylogeny using a 12-taxon, 6, 084-gene data set. The unique, optimal solution, which places Gnetales sister to the conifers, represents a new, large-scale genomic perspective on one of the most puzzling questions in plant systematics.ConclusionsAlthough the GD problem is NP-hard, our novel ILP solution for it can solve instances with data sets consisting of as many as 14 taxa and 1, 000 genes in a few hours. These are the largest instances that have been solved to optimally to date. Thus, this work can provide large-scale genomic perspectives on phylogenetic questions that previously could only be addressed by heuristic estimates.

No abstract