Molecular Biology and Evolution 17:875-881 (2000)
© 2000 Society for Molecular Biology and Evolution
Article |
Likelihood Analysis of Phylogenetic Networks Using Directed Graphical Models
*GSF-Forschungszentrum für Umwelt und Gesundheit, MIPS, am Max-Planck-Institut für Biochemie, Martinsried, Germany;
and
FMI, Physics and Mathematics Department, Mid Sweden University, Sundsvall, Sweden
A method for computing the likelihood of a set of sequences assuming a phylogenetic network as an evolutionary hypothesis is presented. The approach applies directed graphical models to sequence evolution on networks and is a natural generalization of earlier work by Felsenstein on evolutionary trees, including it as a special case. The likelihood computation involves several steps. First, the phylogenetic network is rooted to form a directed acyclic graph (DAG). Then, applying standard models for nucleotide/amino acid substitution, the DAG is converted into a Bayesian network from which the joint probability distribution involving all nodes of the network can be directly read. The joint probability is explicitly dependent on branch lengths and on recombination parameters (prior probability of a parent sequence). The likelihood of the data assuming no knowledge of hidden nodes is obtained by marginalization, i.e., by summing over all combinations of unknown states. As the number of terms increases exponentially with the number of hidden nodes, a Markov chain Monte Carlo procedure (Gibbs sampling) is used to accurately approximate the likelihood by summing over the most important states only. Investigating a human T-cell lymphotropic virus (HTLV) data set and optimizing both branch lengths and recombination parameters, we find that the likelihood of a corresponding phylogenetic network outperforms a set of competing evolutionary trees. In general, except for the case of a tree, the likelihood of a network will be dependent on the choice of the root, even if a reversible model of substitution is applied. Thus, the method also provides a way in which to root a phylogenetic network by choosing a node that produces a most likely network.
CiteULike 
Connotea 
Del.icio.us What's this?
This article has been cited by other articles:
|
|
 |
|
  L. S. Kubatko Identifying Hybridization Events in the Presence of Coalescence via Model Selection Syst Biol, October 1, 2009; 58(5): 478 - 488. [Abstract] [Full Text] [PDF]
|
|
|
|
 |
|
 G. Cardona, M. Llabres, F. Rossello, and G. Valiente A distance metric for a class of tree-sibling phylogenetic networks Bioinformatics, July 1, 2008; 24(13): 1481 - 1488. [Abstract] [Full Text] [PDF]
|
|
|
|
 |
|
 S. Munshaw and T. B. Kepler An Information-Theoretic Method for the Treatment of Plural Ancestry in Phylogenetics Mol. Biol. Evol., June 1, 2008; 25(6): 1199 - 1208. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
H. Birin, Z. Gal-Or, I. Elias, and T. Tuller Inferring horizontal transfers in the presence of rearrangements by the minimum evolution criterion Bioinformatics, March 15, 2008; 24(6): 826 - 832. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
D. Penny, W. T. White, M. D. Hendy, and M. J. Phillips A Bias in ML Estimates of Branch Lengths in the Presence of Multiple Signals Mol. Biol. Evol., February 1, 2008; 25(2): 239 - 242. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
O. Gauthier and F.-J. Lapointe Seeing the Trees for the Network: Consensus, Information Content, and Superphylogenies Syst Biol, April 1, 2007; 56(2): 345 - 355. [Full Text] [PDF]
|
|
|
|
|
|
G. Jin, L. Nakhleh, S. Snir, and T. Tuller Maximum likelihood of phylogenetic networks Bioinformatics, November 1, 2006; 22(21): 2604 - 2611. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
K. Strimmer, C. Wiuf, and V. Moulton Recombination Analysis Using Directed Graphical Models Mol. Biol. Evol., January 1, 2001; 18(1): 97 - 99. [Full Text] [PDF]
|
|
|
|
|
|
M. Steel and D. Penny Parsimony, Likelihood, and the Role of Models in Molecular Phylogenetics Mol. Biol. Evol., June 1, 2000; 17(6): 839 - 850. [Abstract] [Full Text] [PDF]
|
|