onr:"swepub:oai:DiVA.org:miun-13680"
Search: onr:"swepub:oai:DiVA.org:miun-13680" > Likelihood analysis...
- 1 of 1
- Previous record
- Next record
- To hitlist
Likelihood analysis of phylogenetic networks using directed graphical models
- Strimmer, K. (author)
-
- Moulton, Vincent (author)
- Mittuniversitetet,Institutionen för teknik, fysik och matematik (-2008)
- (creator_code:org_t)
- 2000
- 2000
- English.
- In: Molecular biology and evolution. - 0737-4038 .- 1537-1719. ; 17:6, s. 875-881
- Journal article (peer-reviewed)
Abstract
Subject headings
Close
- 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.
Subject headings
- NATURVETENSKAP -- Matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics (hsv//eng)
Keyword
- maximum likelihood
- phylogenetic network
- graphical model
- Bayesian
- network
- evolutionary tree
- Markov chain Monte Carlo sampling
- learning probabilistic networks
- tree topologies
- evolution
- dna
- nucleotide
- sequences
- recombination
- splitstree
- inference
- humans
- MATHEMATICS
- MATEMATIK
Publication and Content Type
- ref (subject category)
- art (subject category)
Find in a library
- Molecular biology and evolution (Search for host publication in LIBRIS)
To the university's database
- 1 of 1
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Strimmer, K.
- Moulton, Vincent
- About the subject
-
- NATURAL SCIENCES
- NATURAL SCIENCES
- and Mathematics
- Articles in the publication
- Molecular biolog ...
- By the university
- Mid Sweden University
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
