Hostname: page-component-8448b6f56d-jr42d Total loading time: 0 Render date: 2024-04-19T18:58:08.481Z Has data issue: false hasContentIssue false

A Bayesian approach to the identification of panmictic populations and the assignment of individuals

Published online by Cambridge University Press:  29 August 2001

KEVIN J. DAWSON
Affiliation:
Laboratoire Génome, Populations et Interactions, CNRS UMR 5000, Université de Montpellier II, Place Eugène Bataillon, 34095 Montpellier Cedex 5, France IACR, Long Ashton Research Station, Department of Agricultural Science, University of Bristol, Bristol BS41 9AF, UK
KHALID BELKHIR
Affiliation:
Laboratoire Génome, Populations et Interactions, CNRS UMR 5000, Université de Montpellier II, Place Eugène Bataillon, 34095 Montpellier Cedex 5, France
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.

We present likelihood-based methods for assigning the individuals in a sample to source populations, on the basis of their genotypes at co-dominant marker loci. The source populations are assumed to be at Hardy–Weinberg and linkage equilibrium, but the allelic composition of these source populations and even the number of source populations represented in the sample are treated as uncertain. The parameter of interest is the partition of the set of sampled individuals, induced by the assignment of individuals to source populations. We present a maximum likelihood method, and then a more powerful Bayesian approach for estimating this sample partition. In general, it will not be feasible to evaluate the evidence supporting each possible partition of the sample. Furthermore, when the number of individuals in the sample is large, it may not even be feasible to evaluate the evidence supporting, individually, each of the most plausible partitions because there may be many individuals which are difficult to assign. To overcome these problems, we use low-dimensional marginals (the ‘co-assignment probabilities’) of the posterior distribution of the sample partition as measures of ‘similarity’, and then apply a hierarchical clustering algorithm to identify clusters of individuals whose assignment together is well supported by the posterior distribution. A binary tree provides a visual representation of how well the posterior distribution supports each cluster in the hierarchy. These methods are applicable to other problems where the parameter of interest is a partition of a set. Because the co-assignment probabilities are independent of the arbitrary labelling of source populations, we avoid the label-switching problem of previous Bayesian methods.

Type
Research Article
Copyright
2001 Cambridge University Press