New insights into trait introgression with the look-ahead intercrossing strategy

被引:2
|
作者
Ni, Zheng [1 ]
Moeinizade, Saba [1 ]
Kusmec, Aaron [2 ]
Hu, Guiping [1 ]
Wang, Lizhi [1 ]
Schnable, Patrick S. [2 ]
机构
[1] Iowa State Univ, Dept Ind & Mfg Syst Engn, Ames, IA 50011 USA
[2] Iowa State Univ, Dept Agron, Ames, IA 50011 USA
来源
G3-GENES GENOMES GENETICS | 2023年 / 13卷 / 04期
基金
美国国家科学基金会;
关键词
trait introgression; intercrossing; backcrossing; look-ahead simulation; MARKER-ASSISTED INTROGRESSION; OPTIMIZED BREEDING STRATEGIES; GENE INTROGRESSION; SELECTION; EFFICIENCY; SIMULATION;
D O I
10.1093/g3journal/jkad042
中图分类号
Q3 [遗传学];
学科分类号
071007 ; 090102 ;
摘要
Trait introgression (TI) can be a time-consuming and costly task that typically requires multiple generations of backcrossing (BC). Usually, the aim is to introduce one or more alleles (e.g. QTLs) from a single donor into an elite recipient, both of which are fully inbred. This article studies the potential advantages of incorporating intercrossing (IC) into TI programs when compared with relying solely on the traditional BC framework. We simulate a TI breeding pipeline using 3 previously proposed selection strategies for the traditional BC scheme and 3 modified strategies that allow IC. Our proposed look-ahead intercrossing method (LAS-IC) combines look-ahead Monte Carlo simulations, intercrossing, and additional selection criteria to improve computational efficiency. We compared the efficiency of the 6 strategies across 5 levels of resource availability considering the generation when the major QTLs have been successfully introduced into the recipient and a desired background recovery rate reached. Simulations demonstrate that the inclusion of intercrossing in a TI program can substantially increase efficiency and the probability of success. The proposed LAS-IC provides the highest probability of success across the different scenarios using fewer resources compared with BC-only strategies.
引用
收藏
页数:13
相关论文
共 50 条
  • [1] A look-ahead Monte Carlo simulation method for improving parental selection in trait introgression
    Saba Moeinizade
    Ye Han
    Hieu Pham
    Guiping Hu
    Lizhi Wang
    Scientific Reports, 11
  • [2] A look-ahead Monte Carlo simulation method for improving parental selection in trait introgression
    Moeinizade, Saba
    Han, Ye
    Pham, Hieu
    Hu, Guiping
    Wang, Lizhi
    SCIENTIFIC REPORTS, 2021, 11 (01)
  • [3] Look-Ahead Bidding Strategy for Energy Storage
    Wang, Yishen
    Dvorkin, Yury
    Fernandez-Blanco, Ricardo
    Xu, Bolun
    Qiu, Ting
    Kirschen, Daniel S.
    IEEE TRANSACTIONS ON SUSTAINABLE ENERGY, 2017, 8 (03) : 1106 - 1117
  • [4] A look-ahead strategy for the implementation of some old and new extrapolation methods
    Brezinski, C
    RedivoZaglia, M
    NUMERICAL ALGORITHMS, 1996, 11 (1-4) : 35 - 55
  • [5] Look-Ahead
    Mannan, Joya
    Cutting Tool Engineering, 2023, 75 (01):
  • [6] LOOK-AHEAD ON PUSHDOWNS
    ENGELFRIET, J
    VOGLER, H
    INFORMATION AND COMPUTATION, 1987, 73 (03) : 245 - 279
  • [7] Improving Query Focused Summarization Using Look-Ahead Strategy
    Badrinath, Rama
    Venkatasubramaniyan, Suresh
    Madhavan, C. E. Veni
    ADVANCES IN INFORMATION RETRIEVAL, 2011, 6611 : 641 - 652
  • [8] A look-ahead strategy for graph matching in retrieval by spatial arrangement
    Berretti, S
    Del Bimbo, A
    Vicario, E
    2000 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO, PROCEEDINGS VOLS I-III, 2000, : 1721 - 1724
  • [9] CONSTRAINED LOOK-AHEAD MANUFACTURING
    ROSENWEIN, MB
    STONE, RE
    WAHLS, ET
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1991, 29 (09) : 1845 - 1851
  • [10] NEW LOOK-AHEAD CODE FOR INCREASED DATA DENSITY
    JACOBY, GV
    IEEE TRANSACTIONS ON MAGNETICS, 1977, 13 (05) : 1202 - 1204