title: Finding noncommunicating sets for Markov chain Monte Carlo estimations on pedigrees.
abstract: Markov chain Monte Carlo (MCMC) has recently gained use as a method of estimating required probability and likelihood functions in pedigree analysis, when exact computation is impractical. However, when a multiallelic locus is involved, irreducibility of the constructed Markov chain, an essential requirement of the MCMC method, may fail. Solutions proposed by several researchers, which do not identify all the noncommunicating sets of genotypic configurations, are inefficient with highly polymorphic loci. This is a particularly serious problem in linkage analysis, because highly polymorphic markers are much more informative and thus are preferred. In the present paper, we describe an algorithm that finds all the noncommunicating classes of genotypic configurations on any pedigree. This leads to a more efficient method of defining an irreducible Markov chain. Examples, including a pedigree from a genetic study of familial Alzheimer disease, are used to illustrate how the algorithm works and how penetrances are modified for specific individuals to ensure irreducibility.
authors.affiliation: Department of Statistics, University of California, Berkeley 94720.
authors.forename: S
authors.initials: S
authors.lastname: Lin
authors.forename: E
authors.initials: E
authors.lastname: Thompson
authors.forename: E
authors.initials: E
authors.lastname: Wijsman
mesh_terms: D000465:Algorithms; D000544:Alzheimer Disease / Q000235:genetics; D002648:Child; D005260:Female; D005838:Genotype; D006239:Haplotypes; D006801:Humans; D008297:Male; D008390:Markov Chains; D008957:Models, Genetic; D009010:Monte Carlo Method; D010375:Pedigree