Fast Neighbor Joining
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 1263-1274
- https://doi.org/10.1007/11523468_102
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- QuickJoin—fast neighbour-joining tree reconstructionBioinformatics, 2004
- Combining polynomial running time and fast convergence for the disk-covering methodJournal of Computer and System Sciences, 2002
- Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution PrincipleJournal of Computational Biology, 2002
- Fast recovery of evolutionary trees with thousands of nodesPublished by Association for Computing Machinery (ACM) ,2001
- Disk-Covering, a Fast-Converging Method for Phylogenetic Tree ReconstructionJournal of Computational Biology, 1999
- The Performance of Neighbor-Joining Methods of Phylogenetic ReconstructionAlgorithmica, 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
- A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequencesJournal of Molecular Evolution, 1980
- Evolution of Protein MoleculesPublished by Elsevier ,1969