Random local neighbor joining: a new method for reconstructing phylogenetic trees.

We have developed a new method for reconstructing phylogenetic trees called random local neighbor-joining (RLNJ). Our method is different from the neighbor-joining method (NJ) of Saitou and Nei and affords a more thorough sampling of solution space by randomly searching for local pair of neighbors in each step. Results using the RLNJ method to analyze yeast data show an increasing possibility to get a smaller S value (sum of branch lengths) compared with the NJ method as cases with more taxa are analyzed and many individual runs using the RLNJ method usually generate more than one topology with small S values. Computer simulation shows the fact that the RLNJ method can improve the possibility of recovering correct topology significantly by affording more than one topology. In addition, when using the RLNJ method, computer simulation also shows that the proportion of correct topologies (P(C)) will increase as the number of different topologies decreases and as the proportion of "most frequent topology" increases. Thus, the number of different topologies and the proportion of "most frequent topology" can be used as auxiliary criteria to evaluate reliability of a phylogenetic tree.

[1]  K. Strimmer,et al.  Inferring confidence sets of possibly misspecified gene trees , 2002, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[2]  M. Nei,et al.  A Simple Method for Estimating and Testing Minimum-Evolution Trees , 1992 .

[3]  J. Felsenstein.  Phylogenies from molecular sequences: inference and reliability. , 1988, Annual review of genetics.

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

[5]  M. Hasegawa,et al.  Relative efficiencies of the maximum likelihood, maximum parsimony, and neighbor-joining methods for estimating protein phylogeny. , 1993, Molecular phylogenetics and evolution.

[6]  A. Zharkikh,et al.  Statistical properties of bootstrap estimation of phylogenetic variability from nucleotide sequences: II. Four taxa without a molecular clock , 1992, Journal of Molecular Evolution.

[7]  A. Rodrigo,et al.  Likelihood-based tests of topologies in phylogenetics. , 2000, Systematic biology.

[8]  Hidetoshi Shimodaira.  An approximately unbiased test of phylogenetic tree selection. , 2002, Systematic biology.

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

[10]  M. Nei,et al.  Theoretical foundation of the minimum-evolution method of phylogenetic inference. , 1993, Molecular biology and evolution.

[11]  W. Doolittle,et al.  Comparison of Bayesian and maximum likelihood bootstrap measures of phylogenetic reliability. , 2003, Molecular biology and evolution.

[12]  W. Fitch,et al.  Construction of phylogenetic trees. , 1967, Science.

[13]  C. Field,et al.  The comparison of the confidence regions in phylogeny. , 2005, Molecular biology and evolution.

[14]  W R Pearson,et al.  Generalized neighbor-joining: more reliable phylogenetic tree reconstruction. , 1999, Molecular biology and evolution.

[15]  A. Halpern,et al.  Weighted neighbor joining: a likelihood-based approach to distance-based phylogeny reconstruction. , 2000, Molecular biology and evolution.

[16]  A. Zharkikh,et al.  Estimation of confidence in phylogeny: the complete-and-partial bootstrap technique. , 1995, Molecular phylogenetics and evolution.

[17]  F. Lutzoni,et al.  Bayes or bootstrap? A simulation study comparing the performance of Bayesian Markov chain Monte Carlo sampling and bootstrapping in assessing phylogenetic confidence. , 2003, Molecular biology and evolution.

[18]  J. Hartigan.  MINIMUM MUTATION FITS TO A GIVEN TREE , 1973 .

[19]  J. Felsenstein.  Numerical Methods for Inferring Evolutionary Trees , 1982, The Quarterly Review of Biology.

[20]  A. Zharkikh,et al.  Statistical properties of bootstrap estimation of phylogenetic variability from nucleotide sequences. I. Four taxa with a molecular clock. , 1992, Molecular biology and evolution.

[21]  O Gascuel,et al.  BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data. , 1997, Molecular biology and evolution.

[22]  E Lizabethhalloran Bradleyefron.  Bootstrap confidence levels for phylogenetic trees , 1996 .

[23]  Wen-Hsiung Li,et al.  NJML: a hybrid algorithm for the neighbor-joining and maximum-likelihood methods. , 2000, Molecular biology and evolution.

[24]  A. Dress,et al.  Split decomposition: a new and useful approach to phylogenetic analysis of distance data. , 1992, Molecular phylogenetics and evolution.

[25]  J. A. Studier,et al.  A note on the neighbor-joining algorithm of Saitou and Nei. , 1988, Molecular biology and evolution.

[26]  N. Saitou,et al.  The neighbor-joining method: a new method for reconstructing phylogenetic trees. , 1987, Molecular biology and evolution.

[27]  A Rzhetsky,et al.  Interior-branch and bootstrap tests of phylogenetic trees. , 1995, Molecular biology and evolution.

[28]  J. Felsenstein.  CONFIDENCE LIMITS ON PHYLOGENIES: AN APPROACH USING THE BOOTSTRAP , 1985, Evolution; international journal of organic evolution.

[29]  J. Huelsenbeck.  Performance of Phylogenetic Methods in Simulation , 1995 .

[30]  Jens Lagergren,et al.  Fast neighbor joining , 2005, Theor. Comput. Sci..

[31]  Joseph Felsenstein,et al.  Is there something wrong with the bootstrap on phylogenies? A reply to Hillis and Bull , 1993 .

[32]  M. Nei,et al.  Molecular Evolution and Phylogenetics , 2000 .

[33]  Sudhir Kumar,et al.  A stepwise algorithm for finding minimum evolution trees. , 1996, Molecular biology and evolution.

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

[35]  M. P. Cummings,et al.  PAUP* Phylogenetic analysis using parsimony (*and other methods) Version 4 , 2000 .

[36]  D. Penny,et al.  Neighbor-joining uses the optimal weight for net divergence. , 1993, Molecular phylogenetics and evolution.

[37]  B. Efron,et al.  Bootstrap confidence levels for phylogenetic trees. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[38]  David Hinkley,et al.  Bootstrap Methods: Another Look at the Jackknife , 2008 .

[39]  N. Saitou,et al.  Relative Efficiencies of the Fitch-Margoliash, Maximum-Parsimony, Maximum-Likelihood, Minimum-Evolution, and Neighbor-joining Methods of Phylogenetic Tree Construction in Obtaining the Correct Tree , 1989 .

[40]  J. Felsenstein,et al.  A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates. , 1994, Molecular biology and evolution.

[41]  W. H. Day.  Computational complexity of inferring phylogenies from dissimilarity matrices. , 1987, Bulletin of mathematical biology.

[42]  Olivier Gascuel,et al.  Concerning the NJ algorithm and its unweighted version, UNJ , 1996, Mathematical Hierarchies and Biology.

[43]  F. McMorris,et al.  Mathematical Hierarchies and Biology , 1997 .