A structural EM algorithm for phylogenetic inference.

@article{citeulike:1649081, abstract = {A central task in the study of molecular evolution is the reconstruction of a phylogenetic tree from sequences of current-day taxa. The most established approach to tree reconstruction is maximum likelihood (ML) analysis. Unfortunately, searching for the maximum likelihood phylogenetic tree is computationally prohibitive for large data sets. In this paper, we describe a new algorithm that uses Structural Expectation Maximization (EM) for learning maximum likelihood phylogenetic trees. This algorithm is similar to the standard EM method for edge-length estimation, except that during iterations of the Structural EM algorithm the topology is improved as well as the edge length. Our algorithm performs iterations of two steps. In the E-step, we use the current tree topology and edge lengths to compute expected sufficient statistics, which summarize the data. In the M-Step, we search for a topology that maximizes the likelihood with respect to these expected sufficient statistics. We show that searching for better topologies inside the M-step can be done efficiently, as opposed to standard methods for topology search. We prove that each iteration of this procedure increases the likelihood of the topology, and thus the procedure must converge. This convergence point, however, can be a suboptimal one. To escape from such "local optima," we further enhance our basic EM procedure by incorporating moves in the flavor of simulated annealing. We evaluate these new algorithms on both synthetic and real sequence data and show that for protein sequences even our basic algorithm finds more plausible trees than existing methods for searching maximum likelihood phylogenies. Furthermore, our algorithms are dramatically faster than such methods, enabling, for the first time, phylogenetic analysis of large protein data sets in the maximum likelihood framework.}, address = {School of Computer Science and Engineering, Hebrew University, Jerusalem, 91904, Israel. nir@cs.huji.ac.il}, author = {Friedman, N. and Ninio, M. and Pe'er, I. and Pupko, T. }, citeulike-article-id = {1649081}, doi = {http://dx.doi.org/10.1089/10665270252935494}, issn = {1066-5277}, journal = {J Comput Biol}, number = {2}, pages = {331--353}, posted-at = {2007-10-31 20:25:06}, priority = {2}, title = {A structural EM algorithm for phylogenetic inference.}, url = {http://dx.doi.org/10.1089/10665270252935494}, volume = {9}, year = {2002} }

TY - JOUR ID - citeulike:1649081 L3 - citeulike-article-id:1649081 TI - A structural EM algorithm for phylogenetic inference. JF - J Comput Biol VL - 9 IS - 2 SP - 331 EP - 353 AD - School of Computer Science and Engineering, Hebrew University, Jerusalem, 91904, Israel. nir@cs.huji.ac.il SN - 1066-5277 N2 - A central task in the study of molecular evolution is the reconstruction of a phylogenetic tree from sequences of current-day taxa. The most established approach to tree reconstruction is maximum likelihood (ML) analysis. Unfortunately, searching for the maximum likelihood phylogenetic tree is computationally prohibitive for large data sets. In this paper, we describe a new algorithm that uses Structural Expectation Maximization (EM) for learning maximum likelihood phylogenetic trees. This algorithm is similar to the standard EM method for edge-length estimation, except that during iterations of the Structural EM algorithm the topology is improved as well as the edge length. Our algorithm performs iterations of two steps. In the E-step, we use the current tree topology and edge lengths to compute expected sufficient statistics, which summarize the data. In the M-Step, we search for a topology that maximizes the likelihood with respect to these expected sufficient statistics. We show that searching for better topologies inside the M-step can be done efficiently, as opposed to standard methods for topology search. We prove that each iteration of this procedure increases the likelihood of the topology, and thus the procedure must converge. This convergence point, however, can be a suboptimal one. To escape from such "local optima," we further enhance our basic EM procedure by incorporating moves in the flavor of simulated annealing. We evaluate these new algorithms on both synthetic and real sequence data and show that for protein sequences even our basic algorithm finds more plausible trees than existing methods for searching maximum likelihood phylogenies. Furthermore, our algorithms are dramatically faster than such methods, enabling, for the first time, phylogenetic analysis of large protein data sets in the maximum likelihood framework. AU - Friedman, N AU - Ninio, M AU - Pe'er, I AU - Pupko, T PY - 2002/// UR - http://dx.doi.org/10.1089/10665270252935494 ER -