Bootstrap-based Support of HGT Inferred by Maximum Parsimony

BackgroundMaximum parsimony is one of the most commonly used criteria for reconstructing phylogenetic trees. Recently, Nakhleh and co-workers extended this criterion to enable reconstruction of phylogenetic networks, and demonstrated its application to detecting reticulate evolutionary relationships. However, one of the major problems with this extension has been that it favors more complex evolutionary relationships over simpler ones, thus having the potential for overestimating the amount of reticulation in the data. An ad hoc solution to this problem that has been used entails inspecting the improvement in the parsimony length as more reticulation events are added to the model, and stopping when the improvement is below a certain threshold.ResultsIn this paper, we address this problem in a more systematic way, by proposing a nonparametric bootstrap-based measure of support of inferred reticulation events, and using it to determine the number of those events, as well as their placements. A number of samples is generated from the given sequence alignment, and reticulation events are inferred based on each sample. Finally, the support of each reticulation event is quantified based on the inferences made over all samples.ConclusionsWe have implemented our method in the NEPAL software tool (available publicly at http://bioinfo.cs.rice.edu/), and studied its performance on both biological and simulated data sets. While our studies show very promising results, they also highlight issues that are inherently challenging when applying the maximum parsimony criterion to detect reticulate evolution.

[1]  W. Fitch.  Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology , 1971 .

[2]  Sagi Snir,et al.  Efficient parsimony-based methods for phylogenetic network reconstruction , 2007, Bioinform..

[3]  D. Morrison,et al.  Networks in phylogenetic analysis: new tools for population biology. , 2005, International journal for parasitology.

[4]  Douglas E. Soltis,et al.  Applying the Bootstrap in Phylogeny Reconstruction , 2003 .

[5]  J. Bull,et al.  An Empirical Test of Bootstrapping as a Method for Assessing Confidence in Phylogenetic Analysis , 1993 .

[6]  Falk Schreiber,et al.  Analysis of Biological Networks , 2008 .

[7]  Luay Nakhleh,et al.  Phylogenetic networks , 2004 .

[8]  Olivier Gascuel,et al.  Reconstructing evolution : new mathematical and computational advances , 2007 .

[9]  Michael P. Cummings,et al.  PAUP* [Phylogenetic Analysis Using Parsimony (and Other Methods)] , 2004 .

[10]  Bernard M. E. Moret,et al.  Network ( Reticulate ) Evolution : Biology , Models , and Algorithms , 2004 .

[11]  Hidetoshi Shimodaira,et al.  Multiple Comparisons of Log-Likelihoods with Applications to Phylogenetic Inference , 1999, Molecular Biology and Evolution.

[12]  T. Tuller,et al.  Inferring phylogenetic networks by the maximum parsimony criterion: a case study. , 2006, Molecular biology and evolution.

[13]  Sagi Snir,et al.  Maximum likelihood of phylogenetic networks , 2006, Bioinform..

[14]  W. H. Day.  Computationally difficult parsimony problems in phylogenetic systematics , 1983 .

[15]  J. Palmer,et al.  Massive horizontal transfer of mitochondrial genes from diverse land plant donors to the basal angiosperm Amborella. , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[16]  D. Huson,et al.  Application of phylogenetic networks in evolutionary studies. , 2006, Molecular biology and evolution.

[17]  Sagi Snir,et al.  Parsimony Score of Phylogenetic Networks: Hardness Results and a Linear-Time Heuristic , 2009, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[18]  R. Graham,et al.  The steiner problem in phylogeny is NP-complete , 1982 .

[19]  Tandy J. Warnow,et al.  Phylogenetic networks: modeling, reconstructibility, and accuracy , 2004, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[20]  L. Nakhleh.  Evolutionary Phylogenetic Networks: Models and Issues , 2010 .

[21]  V. Makarenkov,et al.  Inferring and validating horizontal gene transfer events using bipartition dissimilarity. , 2010, Systematic biology.

[22]  N. Galtier.  A model of horizontal gene transfer and the bacterial phylogeny problem. , 2007, Systematic biology.

[23]  Vladimir Makarenkov,et al.  Phylogenetic Network Construction Approaches , 2006 .

[24]  Sagi Snir,et al.  A New Linear-Time Heuristic Algorithm for Computing the Parsimony Score of Phylogenetic Networks: Theoretical Bounds and Empirical Performance , 2007, ISBRA.

[25]  J. Hein.  A heuristic method to reconstruct the history of sequences subject to recombination , 1993, Journal of Molecular Evolution.

[26]  Bernard M. E. Moret,et al.  Network (Reticulated) Evolution: Biology, Models, and Algorithms , 2004 .

[27]  John M. Mellor-Crummey,et al.  Reconstructing phylogenetic networks using maximum parsimony , 2005, 2005 IEEE Computational Systems Bioinformatics Conference (CSB'05).

[28]  J. Hein.  Reconstructing evolution of sequences subject to recombination using parsimony. , 1990, Mathematical biosciences.