Genomic prediction in hybrid breeding: I. Optimizing the training set design

dc.contributor.authorMelchinger, Albrecht E.
dc.contributor.authorFernando, Rohan
dc.contributor.authorStricker, Christian
dc.contributor.authorSchön, Chris-Carolin
dc.contributor.authorAuinger, Hans-Jürgen
dc.date.accessioned2025-10-27T12:17:36Z
dc.date.available2025-10-27T12:17:36Z
dc.date.issued2023
dc.date.updated2024-12-02T06:34:40Z
dc.description.abstractGenomic prediction holds great promise for hybrid breeding but optimum composition of the training set (TS) as determined by the number of parents (nTS) and crosses per parent (c) has received little attention. Our objective was to examine prediction accuracy (ra) of GCA for lines used as parents of the TS (I1 lines) or not (I0 lines), and H0, H1 and H2 hybrids, comprising crosses of type I0 × I0, I1 × I0 and I1 × I1, respectively, as function of nTS and c. In the theory, we developed estimates for ra of GBLUPs for hybrids: (i)r^a based on the expected prediction accuracy, and (ii) r~a based on ra of GBLUPs of GCA and SCA effects. In the simulation part, hybrid populations were generated using molecular data from two experimental maize data sets. Additive and dominance effects of QTL borrowed from literature were used to simulate six scenarios of traits differing in the proportion (τSCA = 1%, 6%, 22%) of SCA variance in σG2 and heritability (h2 = 0.4, 0.8). Values of r~a and r^a closely agreed with ra for hybrids. For given size NTS = nTS × c of TS, ra of H0 hybrids and GCA of I0 lines was highest for c = 1. Conversely, for GCA of I1 lines and H1 and H2 hybrids, c = 1 yielded lowest ra with concordant results across all scenarios for both data sets. In view of these opposite trends, the optimum choice of c for maximizing selection response across all types of hybrids depends on the size and resources of the breeding program.en
dc.description.sponsorshipOpen Access funding enabled and organized by Projekt DEAL.
dc.description.sponsorshipTechnische Universität München http://dx.doi.org/10.13039/501100005713
dc.description.sponsorshipTechnische Universität München (1025)
dc.identifier.urihttps://doi.org/10.1007/s00122-023-04413-y
dc.identifier.urihttps://hohpublica.uni-hohenheim.de/handle/123456789/16993
dc.language.isoeng
dc.rights.licensecc_by
dc.subjectGenomic prediction
dc.subjectHybrid breeding
dc.subjectTraining set optimization
dc.subjectGeneral combining ability (GCA)
dc.subjectSpecific combining ability (SCA)
dc.subjectPrediction accuracy
dc.subjectMaize
dc.subject.ddc630
dc.titleGenomic prediction in hybrid breeding: I. Optimizing the training set designen
dc.type.diniArticle
dcterms.bibliographicCitationTheoretical and applied genetics, 136 (2023), 8, 176. https://doi.org/10.1007/s00122-023-04413-y. ISSN: 1432-2242
dcterms.bibliographicCitation.issn0040-5752
dcterms.bibliographicCitation.issn1432-2242
dcterms.bibliographicCitation.issue8
dcterms.bibliographicCitation.journaltitleTheoretical and applied genetics
dcterms.bibliographicCitation.originalpublishernameSpringer Berlin Heidelberg
dcterms.bibliographicCitation.volume136
local.export.bibtex@article{Melchinger2023, doi = {10.1007/s00122-023-04413-y}, url = {https://hohpublica.uni-hohenheim.de/handle/123456789/16993}, author = {Melchinger, Albrecht E. and Fernando, Rohan and Stricker, Christian et al.}, title = {Genomic prediction in hybrid breeding: I. Optimizing the training set design}, journal = {Theoretical and applied genetics}, year = {2023}, volume = {136}, number = {8}, }
local.subject.sdg2
local.subject.sdg9
local.subject.sdg12
local.title.fullGenomic prediction in hybrid breeding: I. Optimizing the training set design

Files

Original bundle

Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
s00122-023-04413-y.pdf
Size:
1.95 MB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
122_2023_4413_MOESM1_ESM.pdf
Size:
1.19 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
7.85 KB
Format:
Item-specific license agreed to upon submission
Description: