A few logs suffice to build (almost) all trees: Part II
- 1 June 1999
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 221 (1-2) , 77-118
- https://doi.org/10.1016/s0304-3975(99)00028-6
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- A few logs suffice to build (almost) all trees (I)Random Structures & Algorithms, 1999
- Improved Approximation Algorithms for Tree AlignmentJournal of Algorithms, 1997
- Quartet Puzzling: A Quartet Maximum-Likelihood Method for Reconstructing Tree TopologiesMolecular Biology and Evolution, 1996
- Approximation algorithms for tree alignment with a given phylogenyAlgorithmica, 1996
- A robust model for finding optimal evolutionary treesAlgorithmica, 1995
- Reconstructing Trees When Sequence Sites Evolve at Variable RatesJournal of Computational Biology, 1994
- Nuclear and Mitochondrial DNA Comparisons Reveal Extreme Rate Variation in the Molecular ClockScience, 1986
- Tree structures for proximity dataBritish Journal of Mathematical and Statistical Psychology, 1981
- Taxonomy with confidenceMathematical Biosciences, 1978
- Additive evolutionary treesJournal of Theoretical Biology, 1977