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
中科院分区:
文献类型:
--
作者:
Duan, Weiwei;Zhao, Yang;Chen, Feng
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.