BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data
- PMID: 9254330
- DOI: 10.1093/oxfordjournals.molbev.a025808
BIONJ: an improved version of the NJ algorithm based on a simple model of sequence data
Abstract
We propose an improved version of the neighbor-joining (NJ) algorithm of Saitou and Nei. This new algorithm, BIONJ, follows the same agglomerative scheme as NJ, which consists of iteratively picking a pair of taxa, creating a new mode which represents the cluster of these taxa, and reducing the distance matrix by replacing both taxa by this node. Moreover, BIONJ uses a simple first-order model of the variances and covariances of evolutionary distance estimates. This model is well adapted when these estimates are obtained from aligned sequences. At each step it permits the selection, from the class of admissible reductions, of the reduction which minimizes the variance of the new distance matrix. In this way, we obtain better estimates to choose the pair of taxa to be agglomerated during the next steps. Moreover, in comparison with NJ's estimates, these estimates become better and better as the algorithm proceeds. BIONJ retains the good properties of NJ--especially its low run time. Computer simulations have been performed with 12-taxon model trees to determine BIONJ's efficiency. When the substitution rates are low (maximum pairwise divergence approximately 0.1 substitutions per site) or when they are constant among lineages, BIONJ is only slightly better than NJ. When the substitution rates are higher and vary among lineages,BIONJ clearly has better topological accuracy. In the latter case, for the model trees and the conditions of evolution tested, the topological error reduction is on the average around 20%. With highly-varying-rate trees and with high substitution rates (maximum pairwise divergence approximately 1.0 substitutions per site), the error reduction may even rise above 50%, while the probability of finding the correct tree may be augmented by as much as 15%.
Similar articles
-
Fast NJ-like algorithms to deal with incomplete distance matrices.BMC Bioinformatics. 2008 Mar 26;9:166. doi: 10.1186/1471-2105-9-166. BMC Bioinformatics. 2008. PMID: 18366787 Free PMC article.
-
Improvement of distance-based phylogenetic methods by a local maximum likelihood approach using triplets.Mol Biol Evol. 2002 Nov;19(11):1952-63. doi: 10.1093/oxfordjournals.molbev.a004019. Mol Biol Evol. 2002. PMID: 12411604
-
Getting a tree fast: Neighbor Joining, FastME, and distance-based methods.Curr Protoc Bioinformatics. 2006 Oct;Chapter 6:Unit 6.3. doi: 10.1002/0471250953.bi0603s15. Curr Protoc Bioinformatics. 2006. PMID: 18428768
-
A stepwise algorithm for finding minimum evolution trees.Mol Biol Evol. 1996 Apr;13(4):584-93. doi: 10.1093/oxfordjournals.molbev.a025618. Mol Biol Evol. 1996. PMID: 8882501
-
Neighbor-joining revealed.Mol Biol Evol. 2006 Nov;23(11):1997-2000. doi: 10.1093/molbev/msl072. Epub 2006 Jul 28. Mol Biol Evol. 2006. PMID: 16877499 Review.
Cited by
-
Ultrafast approximation for phylogenetic bootstrap.Mol Biol Evol. 2013 May;30(5):1188-95. doi: 10.1093/molbev/mst024. Epub 2013 Feb 15. Mol Biol Evol. 2013. PMID: 23418397 Free PMC article.
-
Genomic copy number variation in Mus musculus.BMC Genomics. 2015 Jul 4;16(1):497. doi: 10.1186/s12864-015-1713-z. BMC Genomics. 2015. PMID: 26141061 Free PMC article.
-
All insects matter: a review of 160 entomology cases from 1993 to 2007 in Switzerland-part I (Diptera).J Med Entomol. 2024 Mar 13;61(2):400-409. doi: 10.1093/jme/tjad164. J Med Entomol. 2024. PMID: 38157316 Free PMC article. Review.
-
Impact of Early Pandemic SARS-CoV-2 Lineages Replacement with the Variant of Concern P.1 (Gamma) in Western Bahia, Brazil.Viruses. 2022 Oct 21;14(10):2314. doi: 10.3390/v14102314. Viruses. 2022. PMID: 36298869 Free PMC article.
-
Log Transformation Improves Dating of Phylogenies.Mol Biol Evol. 2021 Mar 9;38(3):1151-1167. doi: 10.1093/molbev/msaa222. Mol Biol Evol. 2021. PMID: 32886788 Free PMC article.
MeSH terms
LinkOut - more resources
Full Text Sources
Other Literature Sources