112 citations · 223 across the 16 of their papers we have counts for
Showing 2007Show all
3 papers · 1 filter
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
Convex Rank Tests and Semigraphoids
Jason Morton, Lior Pachter, Anne Shiu +2
Convex rank tests are partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutation…
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…