Fast genomic prediction of breeding values using parallel Markov chain Monte Carlo with convergence diagnosis

Abstract

BackgroundRunning multiple-chain Markov Chain Monte Carlo (MCMC) provides an efficient parallel computing method for complex Bayesian models, although the efficiency of the approach critically depends on the length of the non-parallelizable burn-in period, for which all simulated data are discarded. In practice, this burn-in period is set arbitrarily and often leads to the performance of far more iterations than required. In addition, the accuracy of genomic predictions does not improve after the MCMC reaches equilibrium.ResultsAutomatic tuning of the burn-in length for running multiple-chain MCMC was proposed in the context of genomic predictions using BayesA and BayesCπ models. The performance of parallel computing versus sequential computing and tunable burn-in MCMC versus fixed burn-in MCMC was assessed using simulation data sets as well by applying these methods to genomic predictions of a Chinese Simmental beef cattle population. The results showed that tunable burn-in parallel MCMC had greater speedups than fixed burn-in parallel MCMC, and both had greater speedups relative to sequential (single-chain) MCMC. Nevertheless, genomic estimated breeding values (GEBVs) and genomic prediction accuracies were highly comparable between the various computing approaches. When applied to the genomic predictions of four quantitative traits in a Chinese Simmental population of 1217 beef cattle genotyped by an Illumina Bovine 770 K SNP BeadChip, tunable burn-in multiple-chain BayesCπ (TBM-BayesCπ) outperformed tunable burn-in multiple-chain BayesCπ (TBM-BayesA) and Genomic Best Linear Unbiased Prediction (GBLUP) in terms of the prediction accuracy, although the differences were not necessarily caused by computational factors and could have been intrinsic to the statistical models per se.ConclusionsAutomatically tunable burn-in multiple-chain MCMC provides an accurate and cost-effective tool for high-performance computing of Bayesian genomic prediction models, and this algorithm is generally applicable to high-performance computing of any complex Bayesian statistical model.Electronic supplementary materialThe online version of this article (doi:10.1186/s12859-017-2003-3) contains supplementary material, which is available to authorized users.

GWAS using 2b-RAD sequencing identified three mastitis important SNPs via two-stage association analysis in Chinese Holstein cows

“…Bayesian and Logistic regression model introduced for GWAS detected SNPs associated with clinical mastitis in dairy cows. First, built the following linear regression equation based on phenotype (GUO et al 2018):…”

“…The SNPs effects variances were independent of each other, and each of which followed the same independent distribution (IID) as the inverse chi-square prior normal distribution where v is a parameter of the degree of freedom and S 2 the parameter of scale: P ( 2 ) = χ −2 ( 2 │v, S 2 ) (4) A prior distribution of the criticality of each SNP effect was a t-distribution (MEUWISSEN et al 2001;GUO et al 2018):…”

Genetic Parameter and Hyper-Parameter Estimation Underlie Nitrogen Use Efficiency in Bread Wheat

“…Recent developments in shrinkage estimation [ 17 ] and the utilization of Markov Chain Monte Carlo (MCMC) sampling methods have made GS based on Bayesian whole genome regression feasible. Nevertheless, MCMC sampling algorithms can suffer from slow convergence rates and poor mixing of sample chains [ 18 ], especially when non-additive genetic random effects are included in the model [ 19 ]. In GS, the use of high-density markers requires the application of advanced feature selection algorithms.…”

Assessing the Genetic Background and Selection Signatures of Huaxi Cattle Using High-Density SNP Array

“…Genomic selection technology has been widely used in Huaxi cattle breeding. Multiple strategies have been explored, including the additive dominance model [ 11 ], parallel Markov chain Monte Carlo [ 12 ], haplotype [ 13 ], elastic net [ 14 ], cosine kernel-based Kernel ridge regression (KCRR) [ 15 ], and stacked integrated learning framework [ 16 ], for the model optimization and method development to improve the accuracy of genomic selection. Selection signature analysis can reveal the underlying genetic mechanism of the formation of the new breed in genomic selective molecular breeding [ 17 ].…”