## Abstract

Maximum likelihood (ML) is increasingly used as an optimality criterion for selecting evolutionary trees (Felsenstein, 1981, J. Mol. Evol. 17:368-376), but finding the global optimum is a hard computational task. Because no general analytic solution is known, numeric techniques such as hill climbing or expectation maximization (EM) are used in order to find optimal parameters for a given tree. So far, analytic solutions were derived only for the simplest model - three-taxa, two-state characters, under a molecular clock. Quoting Ziheng Yang (2000, Proc. R. Soc. B 267:109-119), who initiated the analytic approach, "this seems to be the simplest case, but has many of the conceptual and statistical complexities involved in phylogenetic estimation." In this work, we give general analytic solutions for a family of trees with four-taxa, two-state characters, under a molecular clock. The change from three to four taxa incurs a major increase in the complexity of the underlying algebraic system, and requires novel techniques and approaches. We start by presenting the general maximum likelihood problem on phylogenetic trees as a constrained optimization problem, and the resulting system of polynomial equations. In full generality, it is infeasible to solve this system, therefore specialized tools for the molecular clock case are developed. Four-taxa rooted trees have two topologies - the fork (two subtrees with two leaves each) and the comb (one subtree with three leaves, the other with a single leaf). We combine the ultrametric properties of molecular clock fork trees with the Hadamard conjugation (Hendy and Penny, 1993, J. Classif. 10:5-24) to derive a number of topology dependent identities. Employing these identities, we substantially simplify the system of polynomial equations for the fork. We finally employ symbolic algebra software to obtain closed form analytic solutions (expressed parametrically in the input data). In general, four-taxa trees can have multiple ML points (Steel, 1994, Syst. Biol. 43:560-564; Chor et al., 2000, MBE 17:1529-1541). In contrast, we can now prove that each fork topology has a unique (local and global) ML point.

Original language | English |
---|---|

Pages (from-to) | 963-967 |

Number of pages | 5 |

Journal | Systematic Biology |

Volume | 53 |

Issue number | 6 |

DOIs | |

State | Published - Dec 2004 |

Externally published | Yes |

### Bibliographical note

Funding Information:ACKNOWLEDGMENTS This research was supported by ISF grant 418/00. A preliminary version of these results was presented at the RECOMB03 conference in Berlin (Chor et al., 2003).

## Keywords

- Analytic solutions
- Hadamard conjugation
- Maximum likelihood
- Molecular clock
- Phylogenetic reconstruction
- Symbolic algebra software
- Systems of polynomial equations

## ASJC Scopus subject areas

- Genetics
- Ecology, Evolution, Behavior and Systematics