9 citations · 14 across the 3 of their papers we have counts for
3 papers
math.CO2007★ 1 cited
The Neighbor-Net Algorithm
Dan Levy, Lior Pachter
The neighbor-joining algorithm is a popular phylogenetics method for constructing trees from dissimilarity maps. The neighbor-net algorithm is an extension of the neighbor-joining…
cs.DS2006★ 9 cited
Why neighbor-joining works
Radu Mihaescu, Dan Levy, Lior Pachter
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 opti…
q-bio.QM2005★ 4 cited
Neighbor joining with phylogenetic diversity estimates
Dan Levy, Ruriko Yoshida, Lior Pachter
The Neighbor-Joining algorithm is a recursive procedure for reconstructing trees that is based on a transformation of pairwise distances between leaves. We present a generalization…