Li J, Guo M
School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China.
Genet Mol Res. 2007 Sep 5;6(3):522-33.
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.
名为SEMPHY的使用结构期望最大化(SEM)的进化树重建算法是一种有效的方法,但存在局部最优性问题。为了改进SEMPHY,本研究提出了一种基于同伦延拓原理的名为HSEMPHY的新算法来重建进化树。HSEMPHY算法通过最大熵原理计算结构中隐藏变量的条件概率。它可以通过模拟同伦原理的过程并引入同伦参数β来减少最终分辨率初始值的影响。在真实数据集和模拟数据集上对HSEMPHY进行测试,以与SEMPHY以及两种最流行的重建方法PHYML和RAXML进行比较。实验结果表明,HSEMPHY至少与PHYML和RAXML一样好,并且对较差的起始树非常鲁棒。