Sciweavers

19 search results - page 3 / 4
» Recrafting the neighbor-joining method
Sort
View
ESA
1999
Springer
82views Algorithms» more  ESA 1999»
13 years 11 months ago
Quartet Cleaning: Improved Algorithms and Simulations
A critical step in all quartet methods for constructing evolutionary trees is the inference of the topology for each set of four sequences (i.e. quartet). It is a well–known fact...
Vincent Berry, Tao Jiang, Paul E. Kearney, Ming Li...
ISMB
2001
13 years 8 months ago
Designing fast converging phylogenetic methods
Abstract: Absolute fast converging phylogenetic reconstruction methods are provably guaranteed to recover the true tree with high probability from sequences that grow only polynomi...
Luay Nakhleh, Usman Roshan, Katherine St. John, Je...
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 7 months ago
Why neighbor-joining works
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...
Radu Mihaescu, Dan Levy, Lior Pachter
BMCBI
2007
138views more  BMCBI 2007»
13 years 7 months ago
Fast computation of distance estimators
Background: Some distance methods are among the most commonly used methods for reconstructing phylogenetic trees from sequence data. The input to a distance method is a distance m...
Isaac Elias, Jens Lagergren
ALMOB
2007
129views more  ALMOB 2007»
13 years 7 months ago
Consistency of the Neighbor-Net Algorithm
Background: Neighbor-Net is a novel method for phylogenetic analysis that is currently being widely used in areas such as virology, bacteriology, and plant evolution. Given an inp...
David Bryant, Vincent Moulton, Andreas Spillner