Evolutionary tree reconstruction using structural expectation maximization and homotopy.
The evolutionary tree reconstruction algorithm called SEMPHY using structural expectation maximization (SEM) is an efficient approach but has local optimality problem. To improve SEMPHY, a new algorithm named HSEMPHY based on the homotopy continuation principle is proposed in the present study for reconstructing evolutionary trees. The HSEMPHY algorithm computes the condition probability of hidden variables in the structural through maximum entropy principle. It can reduce the influence of the initial value of the final resolution by simulating the process of the homotopy principle and by introducing the homotopy parameter beta. HSEMPHY is tested on real datasets and simulated dataset to compare with SEMPHY and the two most popular reconstruction approaches PHYML and RAXML. Experimental results show that HSEMPHY is at least as good as PHYML and RAXML and is very robust to poor starting trees.
Li
J
J
School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China. lijianfu@hit.edu.cn
Guo
M
M
D000465:Algorithms; D001499:Bayes Theorem; D019295:Computational Biology; D003198:Computer Simulation; D019143:Evolution, Molecular; D016013:Likelihood Functions; D008957:Models, Genetic; D015233:Models, Statistical; D008962:Models, Theoretical; D010363:Pattern Recognition, Automated; D010802:Phylogeny; D011336:Probability; D012984:Software