Sciweavers

30 search results - page 1 / 6
» The Performance of Neighbor-Joining Methods of Phylogenetic ...
Sort
View
ALGORITHMICA
1999
87views more  ALGORITHMICA 1999»
13 years 5 months ago
The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction
We analyze the performance of the popular class of neighbor-joining methods of phylogeny reconstruction. In particular, we find conditions under which these methods will determine ...
Kevin Atteson
WOB
2004
13 years 6 months ago
A Multi-Neighbor-Joining Approach for Phylogenetic Tree Reconstruction and Visualization
ABSTRACT. The computationally challenging problem of reconstructing the phylogeny of a set of contemporary data, such as DNA sequences or morphological attributes, was treated by a...
Ana Estela Antunes da Silva, Wilfredo J. Puma-Vill...
AB
2008
Springer
13 years 7 months ago
The Geometry of the Neighbor-Joining Algorithm for Small Trees
In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr...
Kord Eickmeyer, Ruriko Yoshida
BIBE
2003
IEEE
13 years 10 months ago
An Investigation of Phylogenetic Likelihood Methods
Abstract— We analyze the performance of likelihoodbased approaches used to reconstruct phylogenetic trees. Unlike other techniques such as Neighbor-Joining (NJ) and Maximum Parsi...
Tiffani L. Williams, Bernard M. E. Moret
ISMB
2001
13 years 6 months ago
Designing fast converging phylogenetic methods
Abstract: Absolute fast converging phylogenetic reconstruction methods are provably guaranteed to recover the true tree with high probability from sequences that grow only polynomi...
Luay Nakhleh, Usman Roshan, Katherine St. John, Je...