Open Access
June 2016 A Bayesian graphical model for genome-wide association studies (GWAS)
Laurent Briollais, Adrian Dobra, Jinnan Liu, Matt Friedlander, Hilmi Ozcelik, Hélène Massam
Ann. Appl. Stat. 10(2): 786-811 (June 2016). DOI: 10.1214/16-AOAS909

Abstract

The analysis of GWAS data has long been restricted to simple models that cannot fully capture the genetic architecture of complex human diseases. As a shift from standard approaches, we propose here a general statistical framework for multi-SNP analysis of GWAS data based on a Bayesian graphical model. Our goal is to develop a general approach applicable to a wide range of genetic association problems, including GWAS and fine-mapping studies, and, more specifically, be able to: (1) Assess the joint effect of multiple SNPs that can be linked or unlinked and interact or not; (2) Explore the multi-SNP model space efficiently using the Mode Oriented Stochastic Search (MOSS) algorithm and determine the best models. We illustrate our new methodology with an application to the CGEM breast cancer GWAS data. Our algorithm selected several SNPs embedded in multi-locus models with high posterior probabilities. Most of the SNPs selected have a biological relevance. Interestingly, several of them have never been detected in standard single-SNP analyses. Finally, our approach has been implemented in the open source $R$ package genMOSS.

Citation

Download Citation

Laurent Briollais. Adrian Dobra. Jinnan Liu. Matt Friedlander. Hilmi Ozcelik. Hélène Massam. "A Bayesian graphical model for genome-wide association studies (GWAS)." Ann. Appl. Stat. 10 (2) 786 - 811, June 2016. https://doi.org/10.1214/16-AOAS909

Information

Received: 1 March 2013; Revised: 1 September 2015; Published: June 2016
First available in Project Euclid: 22 July 2016

zbMATH: 06625669
MathSciNet: MR3528360
Digital Object Identifier: 10.1214/16-AOAS909

Keywords: Bayesian , breast cancer , Graphical model , GWAS , SNP , stochastic search

Rights: Copyright © 2016 Institute of Mathematical Statistics

Vol.10 • No. 2 • June 2016
Back to Top