Your browser doesn't support javascript.
loading
Practical implementation of genetic groups in single-step genomic evaluations with Woodbury matrix identity-based genomic relationship inverse.
Koivula, M; Strandén, I; Aamand, G P; Mäntysaari, E A.
Afiliación
  • Koivula M; Natural Resources Institute Finland (Luke), FI-31600 Jokioinen, Finland. Electronic address: Minna.Koivula@Luke.fi.
  • Strandén I; Natural Resources Institute Finland (Luke), FI-31600 Jokioinen, Finland.
  • Aamand GP; Nordic Cattle Genetic Evaluation (NAV), 8200 Aarhus N, Denmark.
  • Mäntysaari EA; Natural Resources Institute Finland (Luke), FI-31600 Jokioinen, Finland.
J Dairy Sci ; 104(9): 10049-10058, 2021 Sep.
Article en En | MEDLINE | ID: mdl-34099294
ABSTRACT
The growing amount of genomic information in dairy cattle has increased computational and modeling challenges in the single-step evaluations. The computational challenges are due to the dense inverses of genomic (G) and pedigree (A22) relationship matrices of genotyped animals in the single-step mixed model equations. An equivalent mixed model equation is given by single-step genomic BLUP that are based on the T matrix (ssGTBLUP), where these inverses are avoided by expressing G-1 through a product of 2 rectangular matrices, and (A22)-1 through sparse matrix blocks of the inverse of full relationship matrix A-1. A proper way to account genetic groups through unknown parent groups (UPG) after the Quaas-Pollak transformation (QP) is one key factor in a single-step model. When the UPG effects are incompletely accounted, the iterative solving method may have convergence problems. In this study, we investigated computational and predictive performance of ssGTBLUP with residual polygenic (RPG) effect and UPG. The QP transformation used A-1 and, in the complete form, T and (A22)-1 matrices as well. The models were tested with official Nordic Holstein milk production test-day data and model. The results show that UPG can be easily implemented in ssGTBLUP having RPG. The complete QP transformation was computationally feasible when preconditioned conjugate gradient iteration and iteration on data without explicitly setting up G or A22 matrices were used. Furthermore, for good convergence of the preconditioned conjugate gradient method, a complete QP transformation was necessary.
Asunto(s)
Palabras clave

Texto completo: 1 Colección: 01-internacional Base de datos: MEDLINE Asunto principal: Genoma / Modelos Genéticos Tipo de estudio: Prognostic_studies Límite: Animals Idioma: En Revista: J Dairy Sci Año: 2021 Tipo del documento: Article

Texto completo: 1 Colección: 01-internacional Base de datos: MEDLINE Asunto principal: Genoma / Modelos Genéticos Tipo de estudio: Prognostic_studies Límite: Animals Idioma: En Revista: J Dairy Sci Año: 2021 Tipo del documento: Article