- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Likelihood-based Inference of Phylogenetic Networks...
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
Likelihood-based Inference of Phylogenetic Networks from Sequence Data by PhyloDAG Roos, Teemu
Description
Processes such as hybridization, horizontal gene transfer, and recombination result in reticulation which can be modeled by phylogenetic networks. Earlier likelihood-based methods for inferring phylogenetic networks from sequence data have been encumbered by the computational challenges related to likelihood evaluations. Consequently, they have required that the possible network hypotheses be given explicitly or implicitly in terms of a backbone tree to which reticulation edges are added. To achieve speed required for unrestricted network search instead of only adding reticulation edges to an initial tree structure, we employ several fast approximate inference techniques. Preliminary numerical and real data experiments demonstrate that the proposed method, PhyloDAG, is able to learn accurate phylogenetic networks based on limited amounts of data using moderate amounts of computational resources.
Item Metadata
Title |
Likelihood-based Inference of Phylogenetic Networks from Sequence Data by PhyloDAG
|
Creator | |
Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
Date Issued |
2017-02-17T09:33
|
Description |
Processes such as hybridization, horizontal gene transfer, and
recombination result in reticulation which can be modeled by
phylogenetic networks. Earlier likelihood-based methods for inferring
phylogenetic networks from sequence data have been encumbered by the
computational challenges related to likelihood evaluations.
Consequently, they have required that the possible network hypotheses be
given explicitly or implicitly in terms of a backbone tree to which
reticulation edges are added. To achieve speed required for unrestricted
network search instead of only adding reticulation edges to an initial
tree structure, we employ several fast approximate inference techniques.
Preliminary numerical and real data experiments demonstrate that the
proposed method, PhyloDAG, is able to learn accurate phylogenetic
networks based on limited amounts of data using moderate amounts of
computational resources.
|
Extent |
33 minutes
|
Subject | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: University of Helsinki
|
Series | |
Date Available |
2017-08-17
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0354415
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Faculty
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International