1. Improved techniques for sampling complex pedigrees with the Gibbs sampler
- Author
-
Liviu R. Totir, K. Joseph Abraham, and Rohan L. Fernando
- Subjects
lcsh:QH426-470 ,Genetic Linkage ,Statistics as Topic ,Biology ,03 medical and health sciences ,symbols.namesake ,Gene Frequency ,Mixing (mathematics) ,Joint probability distribution ,Sampling design ,Gibbs sampler ,Genetics ,Animals ,Humans ,Genetics(clinical) ,Ecology, Evolution, Behavior and Systematics ,Probability ,030304 developmental biology ,lcsh:SF1-1100 ,Linkage (software) ,0303 health sciences ,Research ,030305 genetics & heredity ,Sampling (statistics) ,Markov chain Monte Carlo ,General Medicine ,pedigree peeling ,Quantitative Biology::Genomics ,Pedigree ,Statistics::Computation ,lcsh:Genetics ,symbols ,Animal Science and Zoology ,lcsh:Animal culture ,Computational problem ,Algorithm ,Elston Stewart algorithm ,Algorithms ,Gibbs sampling - Abstract
Markov chain Monte Carlo (MCMC) methods have been widely used to overcome computational problems in linkage and segregation analyses. Many variants of this approach exist and are practiced; among the most popular is the Gibbs sampler. The Gibbs sampler is simple to implement but has (in its simplest form) mixing and reducibility problems; furthermore in order to initiate a Gibbs sampling chain we need a starting genotypic or allelic configuration which is consistent with the marker data in the pedigree and which has suitable weight in the joint distribution. We outline a procedure for finding such a configuration in pedigrees which have too many loci to allow for exact peeling. We also explain how this technique could be used to implement a blocking Gibbs sampler.
- Published
- 2007