Abstract Detail
Species delimitation in polyploid complexes Nakhleh, Luay [1]. Advances in Computational Methods for Phylogenetic Networks in the Presence of Hybridization. Phylogenetic networks extend phylogenetic trees to allow for modeling reticulate evolutionary processes such as hybridization. Early work on computational methods for phylogenetic network inference focused exclusively on reticulations and sought networks with the fewest number of reticulations to fit the data. As processes such as incomplete lineage sorting (ILS) could be at play concurrently with hybridization, work in the last decade has shifted to computational approaches for phylogenetic network inference in the presence of ILS. In such a short period, significant advances have been made on developing and implementing such computational approaches. In particular, parsimony, likelihood, and Bayesian methods have been devised for estimating phylogenetic networks and associated parameters using estimated gene trees as data. Most recently, Bayesian approaches for inferring phylogenetic networks directly from sequence data were developed and implemented. In this talk, I will survey such advances and discuss model assumptions as well as methods' strengths and limitations. Log in to add this item to your schedule
Related Links: The PhyloNet software package for phylogenetic network inference
1 -
Keywords: phylogenetic network hybridization incomplete lineage sorting multispecies coalescent.
Presentation Type: Colloquium Presentations Session: CO01, Species delimitation in polyploid complexes Location: Tucson J/Starr Pass Date: Monday, July 29th, 2019 Time: 10:15 AM Number: CO01007 Abstract ID:344 Candidate for Awards:None |