Online Program Home
  My Program

All Times EDT

Abstract Details

Activity Number: 38 - Inference, Optimization, and Computation on Discrete Structures
Type: Invited
Date/Time: Sunday, August 8, 2021 : 3:30 PM to 5:20 PM
Sponsor: IMS
Abstract #316661
Title: Statistical Summaries of Unlabeled Evolutionary Trees
Author(s): Samyak Rajanala* and Julia A. Palacios
Companies: Stanford University and Stanford University
Keywords: binary trees; evolutionary trees; summarising trees; unlabeled trees; frechet; combinatorial optimisation
Abstract:

Rooted and ranked binary trees are mathematical objects of great importance used to model hierarchical data and evolutionary relationships with applications in many fields including evolutionary biology and genetic epidemiology. Bayesian phylogenetic inference usually explore the posterior distribution of trees via MCMC methods, but assessing uncertainty and summarizing distributions or samples of such trees remains challenging. While labelled phylogenetic trees have been extensively studied, relatively less literature exists for unlabelled trees which are increasingly useful. We exploit recently proposed metrics of unlabelled ranked binary trees and genealogies (equipped with branch lengths) to define the Frechet mean and variance as summaries of these tree distributions. We provide an efficient combinatorial optimization algorithm for computing the Frechet mean from a sample of or distribution on unlabelled ranked tree shapes and unlabelled ranked genealogies. We show the applicability of our summary statistics for studying popular tree distributions and for comparing the SARS-CoV-2 evolutionary trees across different locations during the COVID-19 epidemic in 2020.


Authors who are presenting talks have a * after their name.

Back to the full JSM 2021 program