Fecha/hora: 07/06/2024 12:50:21

Biblioteca(s): | INIA Las Brujas.
Tipo de la producción científica: | Artículos en Revistas Indexadas Internacionales
Circulación/Nivel: | A - 1
Fecha corriente: | 10/09/2014
Fecha de la última actualización: | 18/06/2019
Autoria: | MISZTAL, I.; LEGARRA, A.; AGUILAR, I.
Afiliación: | IGNACY MISZTAL, Universidad de Georgia (UG); ANDRÉS LEGARRA, INRA (Institut National de la Recherche Agronomique); IGNACIO AGUILAR GARCIA, Instituto Nacional de Investigación Agropecuaria (INIA), Uruguay.
Título: | Using recursion to compute the inverse of the genomic relationship matrix.
Año de publicación: | 2014
Fuente/Imprenta: | Journal of Dairy Science, 2014, v.97, no.6, p.3943-3952. OPEN ACCESS.
ISSN: | 0022-0302
DOI: | http://dx.doi.org/10.3168/jds.2013-7752
Idioma: | Inglés
Notas: | Article history: Received November 22, 2013. //  Accepted February 10, 2014.

Contenido:

ABSTRACT.

Computing the inverse of the genomic relationship matrix using recursion was investigated. A traditional algorithm to invert the numerator relationship matrix is based on the observation that the conditional expectation for an additive effect of 1 animal given the effects of all other animals depends on the effects of its sire and dam only, each with a coefficient of 0.5. With genomic relationships, such an expectation depends on all other genotyped animals, and the coefficients do not have any set value. For each animal, the coefficients plus the conditional variance can be called a genomic recursion. If such recursions are known, the mixed model equations can be solved without explicitly creating the inverse of the genomic relationship matrix. Several algorithms were developed to create genomic recursions. In an algorithm with sequential updates, genomic recursions are created animal by animal. That algorithm can also be used to update a known inverse of a genomic relationship matrix for additional genotypes. In an algorithm with forward updates, a newly computed recursion is immediately applied to update recursions for remaining animals. The computing costs for both algorithms depend on the sparsity pattern of the genomic recursions, but are lower or equal than for regular inversion. An algorithm for proven and young animals assumes that the genomic recursions for young animals contain coefficients only for proven animals. Such an algorithm generates exact genomic EBV in genomic BLUP and is an approximation in single-step genomic BLUP. That algorithm has a cubic cost for the number of proven animals and a linear cost for the number of young animals. The genomic recursions can provide new insight into genomic evaluation and possibly reduce costs of genetic predictions with extremely large numbers of genotypes.
© 2014 American Dairy Science Association.

Palabras-Clave: | GENOMIC RELATIONSHIP MATRIX; GENOMIC SELECTION; PRECONDITIONED CONJUGATE GRADIENTE (PCG) ALGORITHM; RECURSION; SINGLE-STEP BLUP.
Thesagro: | GENÓMICA ANIMAL; SELECCIÓN GENÓMICA.
Categoría del tema: | L10 Genética y mejoramiento animal
URL: | http://www.ainfo.inia.uy/digital/bitstream/item/3059/1/Aguilar-I.-2014-Jr.Dairy-Sci.-v.976-p.3943-3952.pdf
Registro original: | INIA Las Brujas (LB)
Ejemplares: | LB - (100028-1) - PXI - AP - DD - PP/JR.DAIRY SC./2014 -  -  - DIS