Multiple maxima of likelihood in phylogenetic trees: an analytic approach

Authors:
Benny Chor;Michael D. Hendy;Barbara R. Holland;David Penny
Affiliations:
Massey University, Palmerston North, New Zealand;Massey University, Palmerston North, New Zealand;Massey University, Palmerston North, New Zealand;Massey University, Palmerston North, New Zealand
Venue:
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Year:
2000

Citing 0
Cited 2

A structural EM algorithm for phylogenetic inference

RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Quartets MaxCut: A Divide and Conquer Quartets Algorithm

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Maximum likelihood (ML) is a widely used criterion for selecting optimal evolutionary trees. However, little is known on the nature of the likelihood surface for trees, especially as to the frequency of multiple optima. We initiate an analytic study for identifying sequences that generate multiple optima. We report a new approach to calculating ML directly, which we have used to find large families of sequences that have multiple optima, including sequences with a continuum of optimal points. Such datasets are best supported by different (two or more) phylogenies that vary significantly in their timings of evolutionary events Some standard biological processes can lead to data with multiple optima and consequently the field needs further investigation. Our results imply that hill climbing techniques, as currently implemented in various software packages, cannot guarantee to find the global ML point, even if it is unique.