| |
|
|
 | Acceso al texto completo restringido a Biblioteca INIA Las Brujas. Por información adicional contacte bibliolb@inia.org.uy. |
|
Registro completo
|
|
Biblioteca (s) : |
INIA Las Brujas. |
|
Fecha : |
12/11/2015 |
|
Actualizado : |
02/12/2015 |
|
Tipo de producción científica : |
Artículos en Revistas Indexadas Internacionales |
|
Autor : |
FRAGOMENI, B.O.; LOURENCO, D.A.L.; TSURUTA, S.; MASUDA, Y.; AGUILAR, I.; MISZTAL, I. |
|
Afiliación : |
IGNACIO AGUILAR GARCIA, INIA (Instituto Nacional de Investigación Agropecuaria), Uruguay. |
|
Título : |
Use of genomic recursions and algorithm for proven and young animals for single-step genomic BLUP analyses - a simulation study. |
|
Fecha de publicación : |
2015 |
|
Fuente / Imprenta : |
Journal of Animal Breeding and Genetics, 2015, v.132, no.5, p. 340-345. |
|
ISSN : |
0931-2668 |
|
DOI : |
10.1111/jbg.12161 |
|
Idioma : |
Inglés |
|
Contenido : |
ABSTRACT.
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 (G) is replaced by an approximation of G1 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 G1 and the approximated G1 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 G1 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.
© 2015 Blackwell Verlag GmbH MenosABSTRACT.
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 (G) is replaced by an approximation of G1 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 G1 and the approximated G1 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 G1 and with recursions were observed. With the recursive algorithm, the number of iterations to achieve convergence was reduced from... Presentar Todo |
|
Palabras claves : |
GENETIC EVALUATION; GENOMIC SELECTION; SINGLE-STEP METHOD. |
|
Thesagro : |
MEJORAMIENTO GENETICO ANIMAL. |
|
Asunto categoría : |
L10 Genética y mejoramiento animal |
|
Marc : |
LEADER 02627naa a2200253 a 4500
001 1053862
005 2015-12-02
008 2015 bl uuuu u00u1 u #d
022 $a0931-2668
024 7 $a10.1111/jbg.12161$2DOI
100 1 $aFRAGOMENI, B.O.
245 $aUse of genomic recursions and algorithm for proven and young animals for single-step genomic BLUP analyses - a simulation study.
260 $c2015
520 $aABSTRACT. 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 (G) is replaced by an approximation of G1 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 G1 and the approximated G1 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 G1 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. © 2015 Blackwell Verlag GmbH
650 $aMEJORAMIENTO GENETICO ANIMAL
653 $aGENETIC EVALUATION
653 $aGENOMIC SELECTION
653 $aSINGLE-STEP METHOD
700 1 $aLOURENCO, D.A.L.
700 1 $aTSURUTA, S.
700 1 $aMASUDA, Y.
700 1 $aAGUILAR, I.
700 1 $aMISZTAL, I.
773 $tJournal of Animal Breeding and Genetics, 2015$gv.132, no.5, p. 340-345.
Descargar
Esconder MarcPresentar Marc Completo |
|
Registro original : |
INIA Las Brujas (LB) |
|
|
Biblioteca
|
Identificación
|
Origen
|
Tipo / Formato
|
Clasificación
|
Cutter
|
Registro
|
Volumen
|
Estado
|
Volver
|
|
|
| Registros recuperados : 5 | |
| 4. |  | AMORÓS, M.E.; PEREIRA DAS NEVES, V.; GALVAN, V.; RODRIGUEZ, A.; AMARAL, J.; ROSSINI, C.; BUENAHORA, J. Alternativas de bajo impacto para el control de Diaphorina citri en la citricultura uruguaya. Revista INIA Uruguay, 2019, no. 56, p. 66-69. (Revista INIA; 56).| Tipo: Artículos en Revistas Agropecuarias |
| Biblioteca(s): INIA Las Brujas. |
|    |
| 5. | | AMORÓS, M.E.; PEREIRA DAS NEVES, V.; RIVAS, F.; BUENAHORA, J.; MARTINI, X.; STELINSKI, L.L.; ROSSINI, C. Response of Diaphorina citri (Hemiptera: Liviidae) to volatiles characteristic of preferred citrus hosts. Arthropod-Plant Interactions, 1 June 2019, Volume 13, Issue 3, Pages 367-374. Doi: https://doi.org/10.1007/s11829-018-9651-8 Article history: Received 21 May 2018 // Accepted 21 October 2018 // First Online 14 November 2018.
Handling Editor: Anna-Karin Borg-Karlson.| Tipo: Artículos en Revistas Indexadas Internacionales | Circulación / Nivel : Internacional - -- |
| Biblioteca(s): INIA Las Brujas. |
|  |
| Registros recuperados : 5 | |
|
| Expresión de búsqueda válido. Check! |
|
|
