Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets
- 1 January 2001
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 31 (1) , 306-322
- https://doi.org/10.1137/s009753970037905x
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Disk-Covering, a Fast-Converging Method for Phylogenetic Tree ReconstructionJournal of Computational Biology, 1999
- Efficient algorithms for inverting evolutionJournal of the ACM, 1999
- A few logs suffice to build (almost) all trees: Part IITheoretical Computer Science, 1999
- A few logs suffice to build (almost) all trees (I)Random Structures & Algorithms, 1999
- On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)SIAM Journal on Computing, 1998
- Algorithms on Strings, Trees and SequencesPublished by Cambridge University Press (CUP) ,1997
- The computational complexity of inferring rooted phylogenies by parsimonyMathematical Biosciences, 1986
- Statistical Inference of PhylogeniesJournal of the Royal Statistical Society. Series A (General), 1983
- Numerical Methods for Inferring Evolutionary TreesThe Quarterly Review of Biology, 1982
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963