Fast phylogeny reconstruction through learning of ancestral sequences (2008)
Mihaescu, Radu, Hill, Cameron, Rao, Satish
Given natural limitations on the length DNA sequences, designing phylogenetic reconstruction methods which are reliable under limited information is a crucial endeavor. There have been two approaches...
Radu Mihaescu, Dan Levy, Lior Pachter
Theorem 2 of [2], which claims to settle Atteson’s edge radius conjecture [1], is invalidly proven. The argument in [2] is inductive, and is based on the assumption that if initially | | ˆ D −...
Combinatorics of least squares trees (2008)
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 formulas have proved...
Why neighbor-joining works (2006)
Mihaescu, Radu, Levy, Dan, Pachter, Lior
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 optimal radius bound as...
Why neighbor-joining works (2006)
Radu Mihaescu, Dan Levy, Lior Pachter
Abstract. 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 optimal...
Lower Bounds for Maximum Parsimony with Gene Order Data (2005)
Abraham Bachrach, Kevin Chen, Chris Harrelson, Radu Mihaescu, Satish Rao, Apurva Shah
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n 3) time dynamic programming...
The SuperSID Project: Exploiting High-level Information for High-accuracy (2003)
Speaker Recognition Douglas, Douglas Reynolds, Walter Andrews, Joseph Campbell, Jiri Navratil, Barbara Peskin, ...
The area of automatic speaker recognition has been dominated by systems using only short-term, low-level acoustic information, such as cepstral features. While these systems have indeed produced very...
Combinatorics of least-squares trees
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 formulas have proved...