16093 search results - page 2 / 3219 » On the optimality of the neighbor-joining algorithm |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's...
ESA
1999
Springer
13 years 9 months ago
1999
Springer
A critical step in all quartet methods for constructing evolutionary trees is the inference of the topology for each set of four sequences (i.e. quartet). It is a well–known fact...
BIBE
2003
IEEE
13 years 10 months ago
2003
IEEE
Abstract— We analyze the performance of likelihoodbased approaches used to reconstruct phylogenetic trees. Unlike other techniques such as Neighbor-Joining (NJ) and Maximum Parsi...
JCB
2008
13 years 5 months ago
2008
Quartet-based phylogeny reconstruction methods, such as Quartet Puzzling, were introduced in the hope that they might be competitive with maximum likelihood methods, without being...
RECOMB
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. We present a fast converging method for distance-based phylogenetic inference, which is novel in two respects. First, it is the only method (to our knowledge) to guarante...