Multigenerational prediction of genetic values using genome-enabled prediction

利用基因组预测进行多代遗传值预测

阅读:2

Abstract

The identification of elite individuals is a critical component of most breeding programs. However, the achievement of this goal is limited by the high cost of phenotyping and experimental research. A significant benefit of genomic selection (GS) to plant breeding is the identification of elite individuals without the need for phenotyping. This study aimed to propose different calibration strategies using combinations between generations from different genetic backgrounds to improve the reliability of GS and to investigate the effects of LD in different types of mating systems: outcrossing (An) self-pollination (Sn) and hybridization (Hn). For this purpose, we simulated a genome with 10 linkage groups. In each group, two QTL were simulated. Subsequently, an F2 population was created, followed by four generations of inbreeding (S1 to S4, H1 to H 4, A1, to A4,). Quantitative traits were simulated in three scenarios considering three degrees of dominance (d/a = 0, 0.5 and 1) and two broad sense heritabilities (h2 = 0.30 and 0.70), totaling six genetic architectures. To evaluate prediction reliability, a model (RR-BLUP) was trained in one generation and used to predict the following generations of mating systems. For example, the marker effects estimated in the F2 population were used to estimate the expected genomic breeding value (GEBV) in populations S1 through A4. The squared correlation between the GEBV and the true genetic value were used to measure the reliability of the predictions. Independently of the population used to estimate the marker effect, reliability showed the lowest values in the scenario where d = 1. For any scenario, the use of the multigenerational prediction methodology improved the reliability of GS.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。