9 citations · 14 across the 3 of their papers we have counts for
1 paper · 1 filter
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…