159
A Computationally Efficient Algorithm for Genomic Prediction Using a Bayesian Model

Monday, August 18, 2014: 11:00 AM
Bayshore Grand Ballroom A (The Westin Bayshore)
Tingting Wang , Faculty of Science, Technology and Engineering, La Trobe University, Melbourne, Australia
Yi-Ping Phoebe Chen , Faculty of Science, Technology and Engineering, La Trobe University, Melbourne, CA, Australia
Michael E. Goddard , The Department of Environment and Primary Industries, Bundoora, Australia
Theo H. E. Meuwissen , Norwegian University of Life Sciences, Ås, Norway
Ben J Hayes , The Department of Environment and Primary Industries, Bundoora, Australia
Abstract Text:

Genomic prediction from dense SNP genotypes is widely used to predict breeding values for livestock, and crop breeding.  In many cases the most accurate methods are Bayesian, usually implemented via Markov Chain Monte Carlo (MCMC) scheme but this is computationally expensive. To retain the advantages of the Bayesian methods, with greatly reduced computation time, an efficient Expectation-Maximisation algorithm termed emBayesR is proposed. emBayesR retains the BayesR model’s prior assumption for SNP effects, of four normal distributions with increasing variance.  To improve the accuracy of genomic prediction compared to other non-MCMC approaches, emBayesR estimates the effect of each SNP while allowing for the error associated with estimation of all other SNP effects. Compared with BayesR, emBayesR reduced computational time up to 8 fold while maintaining similar prediction accuracy on both simulated data, and real 800K dairy data.

Keywords:

Genomic prediction

Expectation-Maximisation algorithm

Markov Chain Monte Carlo