1 citations · 2 across the 2 of their papers we have counts for
2 papers
q-bio.QM2007★ 1 cited
On the optimality of the neighbor-joining algorithm
Kord Eickmeyer, Peter Huggins, Lior Pachter +1
The popular neighbor-joining (NJ) algorithm used in phylogenetics is a greedy algorithm for finding the balanced minimum evolution (BME) tree associated to a dissimilarity map. Fro…
math.CO2007★ 1 cited
Partitioning the Sample Space on Five Taxa for the Neighbor Joining Algorithm
Kord Eickmeyer, Ruriko Yoshida
In this paper, we will analyze the behavior of the Neighbor Joining algorithm on five taxa and we will show that the partition of the sample (data) space for estimation of a tree t…