The distribution of the number of mutations in the genealogy of a sample from a single population

Read the full article See related articles

Listed in

This article is not in any list yet, why not save it to one of your lists.
Log in to save this article

Abstract

The number K of mutations in the genealogy of a sample of n sequences from a single population is one essential summary statistics in molecular population genetics and is equal to the number of segregating sites in the sample under the infinitesites model. Although its expectation and variance are the most widely utilized properties, its sampling formula (i.e., probability distribution) is the foundation for all explorations related to K . Recently, it has been established that K is subject to the Central Limit Theorem, and thus has asymptotic normality. However, due to its slow convergence to normality, the finite-sample distribution remains indispensable. Although an analytic sampling formula exists, its numerical application is limited due to susceptibility to error propagation. This paper presents a new sampling formula for K in a random sample of DNA sequences from a neutral locus without recombination, taken from a single population evolving according to the Wright-Fisher model with a constant effective population size, or the constant-in-state model, which allows the effective population size to vary across different coalescent states. The new sampling formula is expressed as the sum of the probabilities of the various ways mutations can manifest in the sample genealogy and achieves simplicity by partitioning mutations into hypothetical atomic clusters that cannot be further divided. Under the Wright-Fisher model with a constant effective population size, the new sampling formula is closely analogous to the celebrated Ewens’ sampling formula for the number of distinct alleles in a sample. Numerical computation using the new sampling formula is accurate and is limited only by the burden of enumerating a large number of partitions of a large K . However, significant improvement in efficiency can be achieved by prioritizing the enumeration of partitions with a large number of parts.

Article activity feed