全基因组关联研究中隐藏相关性的修正
Correcting for Cryptic Relatedness in Genome-Wide Association Studies
摘要:
虽然选择用于全基因组关联研究(GWAS)的个体可能彼此不密切相关,但可能存在混淆疾病关联证据的遥远(神秘)关系。这些神秘的关系违反了GWAS关于受试者基因组独立性的假设,并且未能解释这些关系导致假阳性和假阴性。本文提出了一种方法来纠正这些隐含的关系。我们准确地检测到遥远的关系,使用期望最大化(EM)算法找到身份系数的基因型数据与已知的先验知识的关系。从身份系数,我们计算的亲属关系系数,并采用亲属关系校正关联测试。我们评估我们的EM亲属关系估计算法的准确性。我们表明,从赖特-费舍尔谱系模拟的基因组,我们的方法收敛速度快,只需要相对较少的网站是准确的。我们还表明,我们的亲属关系系数估计优于国家的最先进的协方差为基础的方法和PLINK的亲属关系估计。为了评估亲属校正关联检验,我们模拟了来自深谱系的个体,并抽取一个位点来重新确定疾病状态。我们应用我们的EM算法来估计亲属关系系数,并进行了亲属关系调整的关联测试。我们的方法与最先进的方法相比毫不逊色,并且远远超过了简单的关联测试。我们提倡使用我们的方法来检测神秘的关系,并纠正关联测试。由于使用身份状态作为潜在变量,我们的模型不仅易于解释,而且推理提供了最先进的准确性。
英文摘要:
While the individuals chosen for a genome-wide association study (GWAS) may not be closely related to each other, there can be distant (cryptic) relationships that confound the evidence of disease association. These cryptic relationships violate the GWAS assumption regarding the independence of the subjects' genomes, and failure to account for these relationships results in both false positives and false negatives. This paper presents a method to correct for these cryptic relationships. We accurately detect distant relationships using an expectation maximization (EM) algorithm for finding the identity coefficients from genotype data with know prior knowledge of relationships. From the identity coefficients we compute the kinship coefficients and employ a kinship-corrected association test. We assess the accuracy of our EM kinship estimation algorithm. We show that on genomes simulated from a Wright-Fisher pedigree, our method converges quickly and requires only a relatively small number of sites to be accurate. We also demonstrate that our kinship coefficient estimates outperform state-of-the-art covariance-based approaches and PLINK's kinship estimate. To assess the kinship-corrected association test, we simulated individuals from deep pedigrees and drew one site to recessively determine the disease status. We applied our EM algorithm to estimate the kinship coefficients and ran a kinship-adjusted association test. Our approach compares favorably with the state-of-the-art and far out-performs a naïve association test. We advocate use of our method to detect cryptic relationships and for correcting association tests. Not only is our model easy to interpret due to the use of identity states as latent variables, but also inference provides state-of-the-art accuracy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。