The bounded coalescent model: Conditioning a genealogy on a minimum root date. (7th September 2022)

• Record Type: Journal Article
• Authors: Carson, Jake; Ledda, Alice; Ferretti, Luca; Keeling, Matt; Didelot, Xavier
• Is Part Of: Journal of theoretical biology. Volume 548(2022)
• Publication Date: 2022-09-07
• Subjects: Coalescent model -- Most recent common ancestor -- Heterochronous sampling -- Phylogenetics -- Phylodynamics; Biology -- Periodicals; Biological Science Disciplines -- Periodicals; Biology -- Periodicals; Biologie -- Périodiques; Theoretische biologie; Biology; Periodicals; 571.05
• DOI: 10.1016/j.jtbi.2022.111186
• Languages: English
• ISSNs: 0022-5193

Abstract

Highlights: The bounded coalescent model is defined as an extension of the standard coalescent model in which all lineages are constrained to find a common ancestor after a predefined date. The probability of a given phylogeny under the bounded coalescent model can be computed. Sampling under the bounded coalescent model can be done directly, which is more efficient than through rejection sampling. Many properties of realised phylogenies under the bounded coalescent model are different from the standard coalescent model, especially when the bound date is recent. The bounded coalescent model has applications in the study of speciation, horizontal gene transfer and transmission of pathogens between hosts. Abstract: The coalescent model represents how individuals sampled from a population may have originated from a last common ancestor. The bounded coalescent model is obtained by conditioning the coalescent model such that the last common ancestor must have existed after a certain date. This conditioned model arises in a variety of applications, such as speciation, horizontal gene transfer or transmission analysis, and yet the bounded coalescent model has not been previously analysed in detail. Here we describe a new algorithm to simulate from this model directly, without resorting to rejection sampling. We show that this direct simulation algorithm is more computationally efficient than the rejection sampling approach. We also show how to calculate the probability of the last common ancestor occurring after a given date, which is required to compute the probability density of realisations under the bounded coalescent model. Our results are applicable in both the isochronous (when all samples have the same date) and heterochronous (where samples can have different dates) settings. We explore the effect of setting a bound on the date of the last common ancestor, and show that it affects a number of properties of the resulting phylogenies. All our methods are implemented in a new R package called BoundedCoalescent which is freely available online.