Skip to main content
Article thumbnail
Location of Repository

Generalized Neighbor-Joining: More Reliable Phylogenetic Tree Reconstruction

By William R. Pearson, Gabriel Robins and Tongtong Zhang

Abstract

We have developed a phylogenetic tree reconstruction method that detects and reports multiple, topologically distant, low cost solutions. Our method is a generalization of the Neighbor-Joining (NJ) method of Nei and Saitou, and affords a more thorough sampling of the solution space by keeping track of multiple partial solutions during its execution. The scope of the solution space sampling is controlled by a pair of user-specified parameters - the total number of alternate solutions and the number of alternate solutions that are randomly selected - effecting a smooth tradeoff between run time and solution quality and diversity. This method can discover topologically distinct low cost solutions. In tests on biological and synthetic datasets using either the least-squares distance or minimum-evolution criterion, the method consistently performed as well as, or better than, either the Neighbor-Joining heuristic or the PHYLIP implementation of the Fitch-Margoliash distance measure. In addi..

Topics: Key Words, phylogenetic reconstruction, neighbor-joining, least-squares, minimum-evolution, solution space sampling
Year: 1998
OAI identifier: oai:CiteSeerX.psu:10.1.1.31.3571
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.virginia.edu/~ro... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.