An Algorithm for the Maximum Likelihood Problem on Evolutionary Trees |
| |
Authors: | Email author" target="_blank">Carlos?A?S?OliveiraEmail author |
| |
Institution: | (1) School of Industrial Engineering and Management, Oklahoma State University, 322 Engineering North, Stillwater, OK, 74078 |
| |
Abstract: | We investigate the problem of reconstructing evolutionary trees with maximum likelihood (MLET). In the MLET problem, a set of genetic sequences is given and a feasible solution is sought, consisting of an evolutionary tree (where general nodes correspond to sequences and input sequences occur as leaves) along with assignments for the interior nodes. Due to the difficulty of solving the MLET directly, we consider two restricted versions of the problem: the ancestral maximum likelihood (AML) and the maximum parsimony (MP) problems. If we let de denote the number of different characters occurring in two nodes linked by edge e, then the objective function of the AML problem is min ∑eσ E(T) H(de/k), where H is the entropy function and k is the length of each sequence. In the MP we consider the objective function min σe∊ E(T) de/k. Both the AML and the MP are NP-hard. We propose a new approach for computing solutions for these problems, based on genetic algorithms. |
| |
Keywords: | genetic sequences phylogenetic analysis combinatorial optimization genetic algorithm |
本文献已被 SpringerLink 等数据库收录! |
|