arrow
返回

Sampling genotypes in large pedigrees with loops

delete2001-07-15
delete25
delete
OA
AI
F
Fernández, SA
R
Rohan L. Fernando *
B
Bernt Guldbrandtsen
L
Liviu R. Totir
A
Alicia L. Carriquiry
DOI:10.1186/1297-9686-33-4-337delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Markov chain Monte Carlo (MCMC) methods have been proposed to overcome computational problems in linkage and segregation analyses. This approach involves sampling genotypes at the marker and trait loci. Scalar-Gibbs is easy to implement, and it is widely used in genetics. However, the Markov chain that corresponds to scalar-Gibbs may not be irreducible when the marker locus has more than two alleles, and even when the chain is irreducible, mixing has been observed to be slow. These problems do not arise if the genotypes are sampled jointly from the entire pedigree. This paper proposes a method to jointly sample genotypes. The method combines the Elston-Stewart algorithm and iterative peeling, and is called the ESIP sampler. For a hypothetical pedigree, genotype probabilities are estimated from samples obtained using ESIP and also scalar-Gibbs. Approximate probabilities were also obtained by iterative peeling. Comparisons of these with exact genotypic probabilities obtained by the Elston-Stewart algorithm showed that ESIP and iterative peeling yielded genotypic probabilities that were very close to the exact values. Nevertheless, estimated probabilities from scalar-Gibbs with a chain of length 235000, including a burn-in of 200000 steps, were less accurate than probabilities estimated using ESIP with a chain of length 10000, with a burn-in of 5000 steps. The effective chain size (ECS) was estimated from the last 25000 elements of the chain of length 125000. For one of the ESIP samplers, the ECS ranged from 21579 to 22741, while for the scalar-Gibbs sampler, the ECS ranged from 64 to 671. Genotype probabilities were also estimated for a large real pedigree consisting of 3223 individuals. For this pedigree, it is not feasible to obtain exact genotype probabilities by the Elston-Stewart algorithm. ESIP and iterative peeling yielded very similar results. However, results from scalar-Gibbs were less accurate.
Keyword:
genotype sampler
Markov chain Monte Carlo
peeling
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

G
Genetics Selection and Evolution
IF:
3.1
论文数:
1.8K
被引数:
4.6K

机构

暂无机构信息
引用论文

引用论文

暂无论文信息