id:"swepub:oai:DiVA.org:miun-13680"
Sökning: id:"swepub:oai:DiVA.org:miun-13680" > Likelihood analysis...
- 1 av 1
- Föregående post
- Nästa post
- Till träfflistan
- Strimmer, K. (författare)
Likelihood analysis of phylogenetic networks using directed graphical models
- Artikel/kapitelEngelska2000
Förlag, utgivningsår, omfång ...
- 2000
- printrdacarrier
Nummerbeteckningar
- LIBRIS-ID:oai:DiVA.org:miun-13680
- https://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-13680URI
Kompletterande språkuppgifter
- Språk:engelska
- Sammanfattning på:engelska
Ingår i deldatabas
- SwePubSwePub
Klassifikation
Anmärkningar
- 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.
Ämnesord och genrebeteckningar
- NATURVETENSKAP Matematik hsv//swe
- NATURAL SCIENCES Mathematics hsv//eng
- 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
Biuppslag (personer, institutioner, konferenser, titlar ...)
- Moulton, VincentMittuniversitetet,Institutionen för teknik, fysik och matematik (-2008)(Swepub:miun)exvinmou (författare)
- MittuniversitetetInstitutionen för teknik, fysik och matematik (-2008) (creator_code:org_t)
Sammanhörande titlar
- Ingår i:Molecular biology and evolution17:6, s. 875-8810737-40381537-1719
Internetlänk
Hitta via bibliotek
- Molecular biology and evolution (Sök värdpublikationen i LIBRIS)
Till lärosätets databas
- 1 av 1
- Föregående post
- Nästa post
- Till träfflistan
Hitta mer i SwePub
- Av författaren/redakt...
- Strimmer, K.
- Moulton, Vincent
- Om ämnet
-
- NATURVETENSKAP
- NATURVETENSKAP
- och Matematik
- Artiklar i publikationen
- Molecular biolog ...
- Av lärosätet
- Mittuniversitetet
Sök utanför SwePub
- Sök vidare i:
- 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 - Nationella bibliotekssystem
- LIBRIS.kb.se
