Loading...
Please wait, while we are loading the content...
Similar Documents
Efficiencies of fast algorithms of phylogenetic inference under the criteria of maximum parsimony, minimum evolution, and maximum likelihood when a large number of sequences are used.
| Content Provider | Semantic Scholar |
|---|---|
| Author | Takahashi, Kenichi Nei, Masatoshi |
| Copyright Year | 2000 |
| Abstract | In phylogenetic inference by maximum-parsimony (MP), minimum-evolution (ME), and maximum-likelihood (ML) methods, it is customary to conduct extensive heuristic searches of MP, ME, and ML trees, examining a large number of different topologies. However, these extensive searches tend to give incorrect tree topologies. Here we show by extensive computer simulation that when the number of nucleotide sequences (m) is large and the number of nucleotides used (n) is relatively small, the simple MP or ML tree search algorithms such as the stepwise addition (SA) plus nearest neighbor interchange (NNI) search and the SA plus subtree pruning regrafting (SPR) search are as efficient as the extensive search algorithms such as the SA plus tree bisection-reconnection (TBR) search in inferring the true tree. In the case of ME methods, the simple neighbor-joining (NJ) algorithm is as efficient as or more efficient than the extensive NJ+TBR search. We show that when ME methods are used, the simple p distance generally gives better results in phylogenetic inference than more complicated distance measures such as the Hasegawa-Kishino-Yano (HKY) distance, even when nucleotide substitution follows the HKY model. When ML methods are used, the simple Jukes-Cantor (JC) model of phylogenetic inference generally shows a better performance than the HKY model even if the likelihood value for the HKY model is much higher than that for the JC model. This indicates that at least in the present case, selecting of a substitution model by using the likelihood ratio test or the AIC index is not appropriate. When n is small relative to m and the extent of sequence divergence is high, the NJ method with p distance often shows a better performance than ML methods with the JC model. However, when the level of sequence divergence is low, this is not the case. |
| File Format | PDF HTM / HTML |
| DOI | 10.1093/oxfordjournals.molbev.a026408 |
| PubMed reference number | 10908645 |
| Journal | Medline |
| Volume Number | 17 |
| Issue Number | 8 |
| Alternate Webpage(s) | http://www.personal.psu.edu/nxm2/2000%20Publications/2000-takahashi-nei.pdf |
| Alternate Webpage(s) | https://doi.org/10.1093/oxfordjournals.molbev.a026408 |
| Journal | Molecular biology and evolution |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
