title: A scalable, knowledge-based analysis framework for genetic association studies.
abstract: BACKGROUND
  Testing for marginal associations between numerous genetic variants and disease may miss complex relationships among variables (e.g., gene-gene interactions). Bayesian approaches can model multiple variables together and offer advantages over conventional model building strategies, including using existing biological evidence as modeling priors and acknowledging that many models may fit the data well. With many candidate variables, Bayesian approaches to variable selection rely on algorithms to approximate the posterior distribution of models, such as Markov-Chain Monte Carlo (MCMC). Unfortunately, MCMC is difficult to parallelize and requires many iterations to adequately sample the posterior. We introduce a scalable algorithm called PEAK that improves the efficiency of MCMC by dividing a large set of variables into related groups using a rooted graph that resembles a mountain peak. Our algorithm takes advantage of parallel computing and existing biological databases when available.
  
  
  RESULTS
  By using graphs to manage a model space with more than 500,000 candidate variables, we were able to improve MCMC efficiency and uncover the true simulated causal variables, including a gene-gene interaction. We applied PEAK to a case-control study of childhood asthma with 2,521 genetic variants. We used an informative graph for oxidative stress derived from Gene Ontology and identified several variants in ERBB4, OXR1, and BCL2 with strong evidence for associations with childhood asthma.
  
  
  CONCLUSIONS
  We introduced an extremely flexible analysis framework capable of efficiently performing Bayesian variable selection on many candidate variables. The PEAK algorithm can be provided with an informative graph, which can be advantageous when considering gene-gene interactions, or a symmetric graph, which simply divides the model space into manageable regions. The PEAK framework is compatible with various model forms, allowing for the algorithm to be configured for different study designs and applications, such as pathway or rare-variant analyses, by simple modifications to the model likelihood and proposal functions.
authors.affiliation: Bioinformatics Research Group, Bina Nusantara University, Jakarta, Indonesia. baurley@gmail.com.
authors.forename: James W
authors.initials: JW
authors.lastname: Baurley
authors.forename: David V
authors.initials: DV
authors.lastname: Conti
mesh_terms: D000465:Algorithms; D001249:Asthma / Q000235:genetics; D001499:Bayes Theorem; D016022:Case-Control Studies; D002648:Child; D019295:Computational Biology / Q000379:methods*; D056726:Genetic Association Studies / Q000379:methods*; D006801:Humans; D051188:Knowledge Bases; D008390:Markov Chains; D008957:Models, Genetic; D009010:Monte Carlo Method; D020641:Polymorphism, Single Nucleotide