Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.rights.license | Reconocimiento 4.0 Internacional. (CC BY) | es |
dc.contributor.author | Rebollo, Inés | es |
dc.contributor.author | Rosas, Juan Eduardo | es |
dc.contributor.author | Aguilar, Ignacio | es |
dc.date.accessioned | 2021-09-21T16:59:40Z | - |
dc.date.available | 2021-09-21T16:59:40Z | - |
dc.date.issued | 2020-11-03 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.12381/450 | - |
dc.description.abstract | Inbreeding increases homozygosity and therefore additive relationships within and among related individuals. The main cause of inbreeding is breeding of related individuals in which case the inbreeding coefficient (Fs) = 0.5asd where asd is the additive relationship among the individual's parents. An extreme case of inbreeding is the self-breeding occurring in plant inbred lines such as those generated by multiple generations of self-pollination, or by double haploid production. In the case of selfing generations, Fs = 1 - 0.5n where n is the number of selfing generations. If the parents of an individual are related and then it is self-bred, both sources for inbreeding should be accounted for in the progeny and Fs = 1 - 0.5n + 0.5n (0.5asd). In order to perform Best Linear Unbiased Prediction (BLUP), accurate calculation of the additive relationship coefficients matrix (A) or its inverse (A-1) is needed depending on the solving algorithm, or for single-step genomic BLUP where the submatrix A22 is used. Current methods to calculate A accounting for selfing generations require the expansion of the pedigree, which is computationally inefficient. Furthermore, freely available algorithms for setting up A-1 without generating A and inverting it do not contemplate selfing generations. The objective of this work was to develop efficient methods for calculating A and A-1 matrices accounting for inbreeding in self-bred individuals. Existing algorithms were adapted to account for selfing generations in A that require less memory than existing methods, and algorithms for the direct construction of A-1 accounting for inbreeding and selfing where developed in R. These algorithms are freely available at https://github.com/minesrebollo. In the future, these methods will be tested in large datasets and their performance will be reported. | es |
dc.description.sponsorship | Agencia Nacional de Investigación e Innovación | es |
dc.language.iso | eng | es |
dc.relation | https://icqg6.org/icqg6-abstracts-book/ | es |
dc.rights | Acceso abierto | es |
dc.subject | self-pollination relationship matrix, computing methods, Single-Step GBLUP. | es |
dc.title | Efficient computation of the additive relationship matrix and its inverse in self-breeding individuals | es |
dc.type | Videograbación | es |
dc.subject.anii | Ciencias Naturales y Exactas | |
dc.subject.anii | Matemáticas | |
dc.subject.anii | Estadística y Probabilidad | |
dc.subject.anii | Ciencias de la Computación e Información | |
dc.subject.anii | Ciencias de la Información y Bioinformática | |
dc.subject.anii | Ciencias Biológicas | |
dc.subject.anii | Genética y Herencia | |
dc.identifier.anii | FSDA_1_2018_1_154120 | es |
dc.type.version | Publicado | es |
dc.anii.institucionresponsable | INIA | es |
dc.identifier.url | https://icqg6.org/wp-content/uploads/2021/04/ines-rebollo-EfficientComputation.mp4 | - |
dc.anii.subjectcompleto | //Ciencias Naturales y Exactas/Matemáticas/Estadística y Probabilidad | es |
dc.anii.subjectcompleto | //Ciencias Naturales y Exactas/Ciencias de la Computación e Información/Ciencias de la Información y Bioinformática | es |
dc.anii.subjectcompleto | //Ciencias Naturales y Exactas/Ciencias Biológicas/Genética y Herencia | es |
Aparece en las colecciones: | Publicaciones de ANII |
Archivos en este ítem:
archivo | Descripción | Tamaño | Formato | ||
---|---|---|---|---|---|
ines-rebollo-EfficientComputation.mp4 | Descargar | Archivo mp4 Presentación en video | 12.98 MB | Unknown |
Las obras en REDI están protegidas por licencias Creative Commons.
Por más información sobre los términos de esta publicación, visita:
Reconocimiento 4.0 Internacional. (CC BY)