Efficient large-scale genomic prediction in approximate genome-based kernel model.

Three computationally efficient algorithms of GP including RHBK, RHDK, and RHPK were developed in approximate genome-based kernel model. The drastically growing amount of genomic information contributes to increasing computational burden of genomic prediction (GP). In this study, we developed three computationally efficient algorithms of GP including RHBK, RHDK, and RHPK in approximate genome-based kernel model, which reduces dimension of genomic data via Nyström approximation and decreases the computational cost significantly thereby. According to the simulation study and real datasets, our three methods demonstrated predictive accuracy similar to or better than RHAPY, GBLUP, and rrBLUP in most cases. They also demonstrated a substantial reduction in computational time compared to GBLUP and rrBLUP in simulation. Due to their advanced computing efficiency, our three methods can be used in a wide range of application scenarios in the future.