TY - JOUR
T1 - Importance sampling for estimating p values in linkage analysis
AU - Shi, Jianxin
AU - Siegmund, David
AU - Yakir, Benny
PY - 2007/9
Y1 - 2007/9
N2 - Importance sampling methods are proposed for estimating the probability that the maximum of a random process exceeds a high threshold, with particular attention to assessing genome-wide significance levels in linkage analysis. The proposed algorithm is applied to computing the conditional significance level, given observed phenotypes, of scan statistics to map quantitative traits in experimental populations and in extended pedigrees of moderate size with partially informative markers, For detecting an additive effect in an intercross, the importance sampling algorithm is roughly 100 times as efficient as direct Monte Carlo simulation when the true significance level is about .05. For pedigrees with partially informative markers, the efficiency varies greatly with intermarker distance, marker polymorphism, sample size, and missing data. In this case the importance sampling algorithm is used to efficiently explore how p values vary with these parameters. Extensions of the algorithm are discussed for the case of multidimensional statistics that arise when considering dominance effects or searching for multiple loci that may involve interactions.
AB - Importance sampling methods are proposed for estimating the probability that the maximum of a random process exceeds a high threshold, with particular attention to assessing genome-wide significance levels in linkage analysis. The proposed algorithm is applied to computing the conditional significance level, given observed phenotypes, of scan statistics to map quantitative traits in experimental populations and in extended pedigrees of moderate size with partially informative markers, For detecting an additive effect in an intercross, the importance sampling algorithm is roughly 100 times as efficient as direct Monte Carlo simulation when the true significance level is about .05. For pedigrees with partially informative markers, the efficiency varies greatly with intermarker distance, marker polymorphism, sample size, and missing data. In this case the importance sampling algorithm is used to efficiently explore how p values vary with these parameters. Extensions of the algorithm are discussed for the case of multidimensional statistics that arise when considering dominance effects or searching for multiple loci that may involve interactions.
KW - Importance sampling
KW - Monte Carlo
KW - Quantitative trait mapping
KW - p value
UR - http://www.scopus.com/inward/record.url?scp=35348928357&partnerID=8YFLogxK
U2 - 10.1198/016214507000000680
DO - 10.1198/016214507000000680
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:35348928357
SN - 0162-1459
VL - 102
SP - 929
EP - 937
JO - Journal of the American Statistical Association
JF - Journal of the American Statistical Association
IS - 479
ER -