Unless otherwise noted, all seminars will take place in the 6th floor conference room of Donald Bren Hall (DBH 6011). Refreshments will be served at 10:50am, and the seminar talks will run from 11:00am until noon.
For additional information, please contact CS Seminar Administrative Coordinator, Mare Stasik, at email@example.com or (949) 824-7651.
November 15, 2019
11:00am - 12:00pm
Donald Bren Hall 6011
In this talk, I will describe new algorithms with provable theoretical guarantees for species tree estimation that address these challenges. First, I will present new algorithms that estimate species trees from gene trees, and that are provably statistically consistent in the presence of gene tree heterogeneity due to Incomplete Lineage Sorting (ILS) or Gene Duplication and Loss (GDL). I will also present a new graph-theoretic "divide-and-conquer" approach to phylogeny estimation that addresses both types of heterogeneity, and that enable computationally intensive methods to scale to large and ultra-large datasets, while maintaining statistical consistency.
This talk is largely based on joint work with my PhD students, Erin Molloy and Vladimir Smirnov (Illinois), but also includes joint work with Sebastien Roch (Wisconsin) and his student Brandon Legried. Much of the work is unpublished.