Please use this identifier to cite or link to this item:
Title: An Algorithm for Sampling Descent Graphs in Large Complex Pedigrees Efficiently
Contributor(s): Henshall, John M (author); Tier, B  (author)
Publication Date: 2003
Open Access: Yes
DOI: 10.1017/S0016672303006232
Handle Link:
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.
Publication Type: Journal Article
Source of Publication: Genetical Research, 81(3), p. 205-212
Publisher: Cambridge University Press
Place of Publication: United Kingdom
ISSN: 0016-6723
Field of Research (FOR): 070201 Animal Breeding
Peer Reviewed: Yes
HERDC Category Description: C1 Refereed Article in a Scholarly Journal
Statistics to Oct 2018: Visitors: 89
Views: 86
Downloads: 10
Appears in Collections:Journal Article

Files in This Item:
7 files
File Description SizeFormat 
open/SOURCE03.pdfAuthor final version114.4 kBAdobe PDF
Download Adobe
open/SOURCE04.pdfPublisher version (open access)132.24 kBAdobe PDF
Download Adobe
Show full item record


checked on Nov 30, 2018

Page view(s)

checked on Feb 8, 2019


checked on Feb 8, 2019
Google Media

Google ScholarTM



Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.