### Abstract

In the maximum parsimony (MP) and minimum evolution (ME) methods of phylogenetic inference, evolutionary trees are constructed by searching for the topology that shows the minimum number of mutational changes required (M) and the smallest sum of branch lengths (S), respectively, whereas in the maximum likelihood (ML) method the topology showing the highest maximum likelihood (A) of observing a given data set is chosen. However, the theoretical basis of the optimization principle remains unclear. We therefore examined the relationships of M, S, and A for the MP, ME, and ML trees with those for the true tree by using computer simulation. The results show that M and S are generally greater for the true tree than for the MP and ME trees when the number of nucleotides examined (n) is relatively small, whereas A is generally lower for the true tree than for the ML tree. This finding indicates that the optimization principle tends to give incorrect topologies when n is small. To deal with this disturbing property of the optimization principle, we suggest that more attention should be given to testing the statistical reliability of an estimated tree rather than to finding the optimal tree with excessive efforts. When a reliability test is conducted, simplified MP, ME, and ML algorithms such as the neighbor-joining method generally give conclusions about phylogenetic inference very similar to those obtained by the more extensive tree search algorithms.

Original language | English (US) |
---|---|

Pages (from-to) | 12390-12397 |

Number of pages | 8 |

Journal | Proceedings of the National Academy of Sciences of the United States of America |

Volume | 95 |

Issue number | 21 |

DOIs | |

Publication status | Published - Oct 13 1998 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Genetics
- General

### Cite this

*Proceedings of the National Academy of Sciences of the United States of America*,

*95*(21), 12390-12397. https://doi.org/10.1073/pnas.95.21.12390