An Algorithm for Sampling Descent Graphs in Large Complex Pedigrees Efficiently

Title
An Algorithm for Sampling Descent Graphs in Large Complex Pedigrees Efficiently
Publication Date
2003
Author(s)
Henshall, John M
Tier, B
Type of document
Journal Article
Language
en
Entity Type
Publication
Publisher
Cambridge University Press
Place of publication
United Kingdom
DOI
10.1017/S0016672303006232
UNE publication id
une:394
Abstract
No exact method for determining genotypic and identity-by-descent probabilities is available for large, complex pedigrees. Approximate methods for such pedigrees cannot be guaranteed to be unbiased. Anew method is proposed that uses the Metropolis-Hastings algorithm to sample a Markov Chain of descent graphs which fit the pedigree and known genotypes. Unknown genotypes are determined from each descent graph. Genotypic probabilities are estimated as their means. The algorithm is shown to be unbiased for small, complex pedigrees and feasible and consistent for large complex pedigrees.
Link
link
Citation
Genetical Research, 81(3), p. 205-212
ISSN
1469-5073
0016-6723
Start page
205
End page
212

Files:

NameSizeformatDescriptionLink
administrative/PREMIS.xml 0.735 KB PREMIS.xml View document
closed/SOURCE01.pdf 60.014 KB application/pdf administrative View document
open/SOURCE03.pdf 117.148 KB application/pdf Author final version View document
administrative/JHOVE.xml 47.907 KB JHOVE.xml View document
administrative/MODS.xml 3.495 KB MODS.xml View document
closed/SOURCE02.pdf 25.501 KB application/pdf administrative View document
open/SOURCE04.pdf 135.411 KB application/pdf Publisher version (open access) View document