next on phyloseminar.org

To attend a seminar, please visit our YouTube channel.

Markov genealogy process

Aaron King
University of Michigan

Phylodynamics via Markov genealogy processes (1/2)

Aaron King
Aaron King

Phylodynamic inference allows us to extract information on determinants of epidemic dynamics from sampled pathogen genomes. Specifically, phylodynamics seeks to infer the structure and parameterization of dynamic population models from patterns of shared ancestry. A key problem in phylodynamics has been a mismatch between inference methodology and epidemiological models: the approximations that must be made to perform inference conflict with questions of great interest. I will describe recent work in which we have obtained exact expressions for phylodynamic likelihoods associated with population models of (almost) arbitrary complexity. These results unify and strictly extend existing approaches and broaden the scope of phylodynamic inference methods.

In the first talk, I will discuss what phylodynamics is, describe commonly used approaches to phylodynamic inference, and explain the need for better methods. I will then show how so-called Markov genealogy processes provide a useful formalism for the problem. In particular, I will show how every discretely structured Markov population process induces a unique Markov process in the space of genealogies.

Aaron King
University of Michigan

Phylodynamics via Markov genealogy processes (2/2)

Phylodynamic inference allows us to extract information on determinants of epidemic dynamics from sampled pathogen genomes. Specifically, phylodynamics seeks to infer the structure and parameterization of dynamic population models from patterns of shared ancestry. A key problem in phylodynamics has been a mismatch between inference methodology and epidemiological models: the approximations that must be made to perform inference conflict with questions of great interest. I will describe recent work in which we have obtained exact expressions for phylodynamic likelihoods associated with population models of (almost) arbitrary complexity. These results unify and strictly extend existing approaches and broaden the scope of phylodynamic inference methods.

In the second talk, I will deduce an exact expression for the likelihood of an observed genealogy, as the solution to a well-defined filter equation, which can be solved numerically using standard Monte Carlo techniques. I will conclude by highlighting the need for improved algorithms and indicating some open questions.

Qianying Lin
Los Alamos

Segment trees can not identify viral genomic reassortment

Reassortment is an evolutionary process common in viruses with segmented genomes. These viruses can swap whole genomic segments during cellular co-infection, giving rise to novel progeny, i.e., the reassortant, formed from the mixture of parental segments. The reassortant can lead to severe illness, vaccine-elicited immunity escape, increased fitness, and access to new hosts, which pressures public health surveillance, disease control, and prevention. In light of the Markov Genealogy Process, we can simultaneously model the interdependent viral evolution of each segment tree in the context of a given epidemiological process, incorporated with genealogical changes associated with specified reassortment rates. In doing so, we argue that, in general, the number and pattern of reassortment events are not identifiable from segment trees alone, even with theoretically ideal data. We call this fact the fundamental problem of reassortment, which we illustrate using the concept of the "first-infection tree", a typically but not always counterfactual genealogy that would have been observed in the segment trees had no reassortment occurred. Further, we illustrate four problems that can arise logically in inferring reassortment events. Using simulated data, we show that these problems are common and can distort our perception of reassortment, even in small data sets. Finally, we discuss how existing methods can be augmented or adapted to account for the fundamental problem of reassortment and the four additional situations that can complicate the inference of reassortment.