Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-28T00:46:20.288Z Has data issue: false hasContentIssue false
  • English
  • Français

Error tolerant parent identification from a finite set of individuals

Published online by Cambridge University Press:  01 August 1997

MAGALI SANCRISTOBAL  and
CLAUDE CHEVALET
MAGALI SANCRISTOBAL
Affiliation:
Laboratoire de Génétique Cellulaire, Institut National de la Recherche Agronomique, BP 27, 31326 Castanet Tolosan Cédex, France
CLAUDE CHEVALET
Affiliation:
Laboratoire de Génétique Cellulaire, Institut National de la Recherche Agronomique, BP 27, 31326 Castanet Tolosan Cédex, 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 consider using microsatellites for paternity checking and parent identification in different population structures, and allowing for possible typing errors or mutations. Statistical rules derived from the Bayesian and the sampling approaches are discussed in the case involving the choice of the true father–mother pair among a finite set of possible parental pairs. General situations are investigated by means of random simulations, in order to characterize the joint influences of the number and polymorphism of typed loci, the population structure and size, and error rates. Approximate expressions are provided that give the efficiency of a set of markers for identifying the parents in various mating schemes. The importance of a non-zero value for the typing error rate in the likelihood is highlighted.

Type
Research Article
Information
Genetics Research , Volume 70 , Issue 1 , August 1997 , pp. 53 - 62
Copyright
© 1997 Cambridge University Press