Repository logo
Log In
Log in as University member:
Log in as external user:
Have you forgotten your password?

Please contact the hohPublica team if you do not have a valid Hohenheim user account (hohPublica@uni-hohenheim.de)
Hilfe
  • English
  • Deutsch
    Communities & Collections
    All of hohPublica
Log In
Log in as University member:
Log in as external user:
Have you forgotten your password?

Please contact the hohPublica team if you do not have a valid Hohenheim user account (hohPublica@uni-hohenheim.de)
Hilfe
  • English
  • Deutsch
  1. Home
  2. Person

Browsing by Person "Sahr, Morten"

Type the first few letters and click on the Browse button
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    Publication
    Assessing the response to genomic selection by simulation
    (2022) Buntaran, Harimurti; Bernal-Vasquez, Angela Maria; Gordillo, Andres; Sahr, Morten; Wimmer, Valentin; Piepho, Hans-Peter
    The goal of any plant breeding program is to maximize genetic gain for traits of interest. In classical quantitative genetics, the genetic gain can be obtained from what is known as “Breeder’s equation”. In the past, only phenotypic data were used to compute the genetic gain. The advent of genomic prediction (GP) has opened the door to the utilization of dense markers for estimating genomic breeding values or GBV. The salient feature of GP is the possibility to carry out genomic selection with the assistance of the kinship matrix, hence improving the prediction accuracy and accelerating the breeding cycle. However, estimates of GBV as such do not provide the full information on the number of entries to be selected as in the classical response to selection. In this paper, we use simulation, based on a fitted mixed model for GP in a multi-environmental framework, to answer two typical questions of a plant breeder: (1) How many entries need to be selected to have a defined probability of selecting the truly best entry from the population; (2) what is the probability of obtaining the truly best entries when some top-ranked entries are selected.

  • Contact
  • FAQ
  • Cookie settings
  • Imprint/Privacy policy