Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-14T07:33:50.556Z Has data issue: false hasContentIssue false

Approximate Sampling Formulae for General Finite-Alleles Models of Mutation

Published online by Cambridge University Press:  04 January 2016

Anand Bhaskar*
Affiliation:
University of California, Berkeley
John A. Kamm*
Affiliation:
University of California, Berkeley
Yun S. Song*
Affiliation:
University of California, Berkeley
*
∗ Postal address: Computer Science Division, University of California, Berkeley, CA 94720, USA.
∗∗ Postal address: Department of Statistics, University of California, Berkeley, CA 94720, USA.
∗∗∗ Postal address: Computer Science Division and Department of Statistics, University of California, Berkeley, CA 94720, USA. Email address: yss@stat.berkeley.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Many applications in genetic analyses utilize sampling distributions, which describe the probability of observing a sample of DNA sequences randomly drawn from a population. In the one-locus case with special models of mutation, such as the infinite-alleles model or the finite-alleles parent-independent mutation model, closed-form sampling distributions under the coalescent have been known for many decades. However, no exact formula is currently known for more general models of mutation that are of biological interest. In this paper, models with finitely-many alleles are considered, and an urn construction related to the coalescent is used to derive approximate closed-form sampling formulae for an arbitrary irreducible recurrent mutation model or for a reversible recurrent mutation model, depending on whether the number of distinct observed allele types is at most three or four, respectively. It is demonstrated empirically that the formulae derived here are highly accurate when the per-base mutation rate is low, which holds for many biological organisms.

Information

Type
General Applied Probability
Copyright
© Applied Probability Trust