Department of Industrial and Manufacturing Systems Engineering, Iowa State University, Ames, IA, 50011, USA.
Sci Rep. 2021 Feb 18;11(1):4124. doi: 10.1038/s41598-021-83567-5.
Recent advances in genomic selection (GS) have demonstrated the importance of not only the accuracy of genomic prediction but also the intelligence of selection strategies. The look ahead selection algorithm, for example, has been found to significantly outperform the widely used truncation selection approach in terms of genetic gain, thanks to its strategy of selecting breeding parents that may not necessarily be elite themselves but have the best chance of producing elite progeny in the future. This paper presents the look ahead trace back algorithm as a new variant of the look ahead approach, which introduces several improvements to further accelerate genetic gain especially under imperfect genomic prediction. Perhaps an even more significant contribution of this paper is the design of opaque simulators for evaluating the performance of GS algorithms. These simulators are partially observable, explicitly capture both additive and non-additive genetic effects, and simulate uncertain recombination events more realistically. In contrast, most existing GS simulation settings are transparent, either explicitly or implicitly allowing the GS algorithm to exploit certain critical information that may not be possible in actual breeding programs. Comprehensive computational experiments were carried out using a maize data set to compare a variety of GS algorithms under four simulators with different levels of opacity. These results reveal how differently a same GS algorithm would interact with different simulators, suggesting the need for continued research in the design of more realistic simulators. As long as GS algorithms continue to be trained in silico rather than in planta, the best way to avoid disappointing discrepancy between their simulated and actual performances may be to make the simulator as akin to the complex and opaque nature as possible.
近年来,基因组选择(GS)的进展表明,不仅基因组预测的准确性很重要,而且选择策略的智能性也很重要。例如,前瞻性选择算法在遗传增益方面被发现明显优于广泛使用的截断选择方法,这要归功于其选择育种亲本的策略,这些亲本本身不一定是精英,但在未来有最好的机会产生精英后代。本文提出了前瞻性回溯算法作为前瞻性方法的一个新变体,它引入了一些改进,以进一步加速遗传增益,特别是在基因组预测不完善的情况下。也许本文更重要的贡献是设计用于评估 GS 算法性能的不透明模拟器。这些模拟器是部分可观察的,明确捕获加性和非加性遗传效应,并更真实地模拟不确定的重组事件。相比之下,大多数现有的 GS 模拟设置是透明的,无论是显式地还是隐式地允许 GS 算法利用某些在实际育种计划中可能不可能的关键信息。使用玉米数据集进行了全面的计算实验,在四个具有不同不透明度的模拟器下比较了各种 GS 算法。这些结果揭示了同一个 GS 算法如何与不同的模拟器交互,这表明需要继续研究设计更现实的模拟器。只要 GS 算法继续在计算机上进行训练,而不是在植物上进行训练,避免其模拟和实际性能之间令人失望的差异的最佳方法可能是使模拟器尽可能类似于复杂和不透明的性质。