Use of genomic recursions and algorithm for proven and young animals for single‐step genomic BLUP analyses – a simulation study. (10th April 2015)

• Record Type: Journal Article
• Authors: Fragomeni, B.O.; Lourenco, D.A.L.; Tsuruta, S.; Masuda, Y.; Aguilar, I.; Misztal, I.
• Is Part Of: Journal of animal breeding and genetics. Volume 132:Number 5(2015:Oct.)
• Page Start: 340
• Page End: 345
• Publication Date: 2015-04-10
• Subjects: Livestock -- Breeding -- Periodicals; Livestock -- Genetics -- Periodicals; 636.0820
• DOI: 10.1111/jbg.12161
• Languages: English
• ISSNs: 0931-2668

Abstract

<abstract abstract-type="main" id="jbg12161-abs-0001"> <title>Summary</title> <p>The purpose of this study was to examine accuracy of genomic selection via single‐step genomic BLUP (ssGBLUP) when the direct inverse of the genomic relationship matrix (<italic><bold>G</bold></italic>) is replaced by an approximation of <bold>G</bold><sup>−1</sup> based on recursions for young genotyped animals conditioned on a subset of proven animals, termed algorithm for proven and young animals (APY). With the efficient implementation, this algorithm has a cubic cost with proven animals and linear with young animals. Ten duplicate data sets mimicking a dairy cattle population were simulated. In a first scenario, genomic information for 20k genotyped bulls, divided in 7k proven and 13k young bulls, was generated for each replicate. In a second scenario, 5k genotyped cows with phenotypes were included in the analysis as young animals. Accuracies (average for the 10 replicates) in regular EBV were 0.72 and 0.34 for proven and young animals, respectively. When genomic information was included, they increased to 0.75 and 0.50. No differences between genomic EBV (GEBV) obtained with the regular <bold>G</bold><sup>−1</sup> and the approximated <bold>G</bold><sup>−1</sup> via the recursive method were observed. In the second scenario, accuracies in GEBV (0.76, 0.51 and 0.59 for proven bulls, young males and young females, respectively) were also higher than those in EBV (0.72, 0.35 and 0.49). Again, no differences between GEBV with regular <bold>G</bold><sup>−1</sup> and with recursions were observed. With the recursive algorithm, the number of iterations to achieve convergence was reduced from 227 to 206 in the first scenario and from 232 to 209 in the second scenario. Cows can be treated as young animals in APY without reducing the accuracy. The proposed algorithm can be implemented to reduce computing costs and to overcome current limitations on the number of genotyped animals in the ssGBLUP method.</p> </abstract>