25 citations · 38 across the 3 of their papers we have counts for
3 papers
cs.DS2008★ 4 cited
Fast phylogeny reconstruction through learning of ancestral sequences
Radu Mihaescu, Cameron Hill, Satish Rao
Given natural limitations on the length DNA sequences, designing phylogenetic reconstruction methods which are reliable under limited information is a crucial endeavor. There have…
math.CO2008★ 25 cited
Combinatorics of least squares trees
Radu Mihaescu, Lior Pachter
A recurring theme in the least squares approach to phylogenetics has been the discovery of elegant combinatorial formulas for the least squares estimates of edge lengths. These for…
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…