25 citations · 38 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
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…
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…