A Simple Method for Estimating and Testing Minimum-Evolution Trees
Clicks: 2
ID: 292131
1992
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Emerging Content
0.3
/100
2 views
1 readers
AI Quality Assessment
Not analyzed
Readership in this journal
EmergingRanked #234 of 245 articles by views in molecular biology and evolution
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 245 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
A simple method for estimating and testing phylogenetic trees under the principle of minimum evolution (ME) is presented. The basic procedure of this method is first to obtain the neighbor-joining (NJ) tree by Saitou and Nei’s method and then to search for a tree with the minimum value of the sum (S) of branch lengths by examining all trees that are closely related to the NJ tree. Once the ME tree is identified, a statistical test is conducted for the difference in S between this tree and other closely related trees. The mathematical method required for conducting this test is developed by using the least-squares approach. Computer simulation has shown that this method identifies the correct tree with a high probability, as long as the number of nucleotides examined is sufficiently large. It has also been shown that the topology of the NJ tree is almost always identical with that of the ME tree. A method for obtaining least-squares estimates (and their standard errors) of branch lengths for a given topology is also presented. This method can be used for testing the reliability of the branching pattern of the ME tree. However, the statistical test of S values is more powerful in rejecting incorrect trees than is the branch-length test or bootstrapping. Furthermore, both a mathematical method for computing the number of trees with a given value of topological difference from the NJ tree and a computer algorithm for identifying all the topologies are developed.
| Reference Key |
openalex_W2102102802
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Andrey Rzhetsky, Masatoshi Nei |
| Journal | molecular biology and evolution |
| Year | 1992 |
| DOI |
10.1093/oxfordjournals.molbev.a040771
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.