.png){kind=icon}
返回
Improved techniques for sampling complex pedigrees with the Gibbs sampler
.png){kind=icon}
OA
AI
DOI：10.1051/gse:2006032.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Gibbs sampler
Markov chain Monte Carlo
pedigree peeling
Elston Stewart algorithm
期刊
G
IF:
3.1
论文数:
1.8K
被引数:
4.6K
机构
暂无机构信息
引用论文
.png){kind=icon}
Dimerization and protonation reactions of nitrosonitrobenzenes radical anions亚硝基硝基苯自由基阴离子的二聚化与质子化反应
PREAI
分享收藏
没有更多内容
没有更多内容