A fast algorithm for Bayesian multi-locus model in genome-wide association studies

A fast algorithm for Bayesian multi-locus model in genome-wide association studies
复制标题

全基因组关联研究中贝叶斯多基因座模型的快速算法。

DOI:
10.1007/s00438-017-1322-4
复制
发表时间:
2017-08-01
影响因子:
3.1
通讯作者:
Chen, Feng
Chen, Feng
中科院分区:
生物学3区
文献类型:
--
作者:
Duan, Weiwei;Zhao, Yang;Chen, Feng

文献摘要

被引文献

相似文献

全基因组关联研究(GWAS)已经确定了大量与复杂性状相关的单核苷酸多态性(SNPs)。最近开发的一种通过同时拟合所有SNP来估计遗传力的线性混合模型表明,常见变异可以解释很大一部分遗传力,这暗示了GWAS中通常使用的单一变异分析的效力较低。因此,在贝叶斯框架下已经提出了许多多位点收缩模型。然而,大多数模型使用马尔可夫链蒙特卡罗(MCMC)算法,这些算法耗时且难以应用于GWAS数据。在此,我们提出一种使用变分推断的贝叶斯自适应套索快速算法(BALVI)。大量的模拟和真实数据分析表明,我们的模型在准确性和速度方面优于著名的贝叶斯套索和贝叶斯自适应套索模型。BAL - VI可以在大约半天内完成对约3400名受试者和约570,000个SNP的肺癌GWAS数据的同时分析。
Genome-wide association studies (GWAS) have identified a large amount of single-nucleotide polymorphisms (SNPs) associated with complex traits. A recently developed linear mixed model for estimating heritability by simultaneously fitting all SNPs suggests that common variants can explain a substantial fraction of heritability, which hints at the low power of single variant analysis typically used in GWAS. Consequently, many multi-locus shrinkage models have been proposed under a Bayesian framework. However, most use Markov Chain Monte Carlo (MCMC) algorithm, which are time-consuming and challenging to apply to GWAS data. Here, we propose a fast algorithm of Bayesian adaptive lasso using variational inference (BALVI). Extensive simulations and real data analysis indicate that our model outperforms the well-known Bayesian lasso and Bayesian adaptive lasso models in accuracy and speed. BAL-VI can complete a simultaneous analysis of a lung cancer GWAS data with similar to 3400 subjects and similar to 570,000 SNPs in about half a day.