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 条
  • [41] Pipelined LMS adaptive filter using a new look-ahead transformation
    Matsubara, K
    Nishikawa, K
    Kiya, H
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 1999, 46 (01) : 51 - 55
  • [42] Pipelined LMS adaptive filter using a new look-ahead transformation
    Matsubara, K
    Nishikawa, K
    Kiya, H
    ISCAS '97 - PROCEEDINGS OF 1997 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS I - IV: CIRCUITS AND SYSTEMS IN THE INFORMATION AGE, 1997, : 2309 - 2312
  • [43] New look-ahead algorithm for pipelined implementation of recursive digital filters
    Shaw, AK
    Imtiaz, M
    1996 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, CONFERENCE PROCEEDINGS, VOLS 1-6, 1996, : 3229 - 3232
  • [44] New High-Speed Multioutput Carry Look-Ahead Adders
    Efstathiou, Costas
    Owda, Zaher
    Tsiatouhas, Yiorgos
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2013, 60 (10) : 667 - 671
  • [45] A New Carry Look-Ahead Adder Architecture Optimized for Speed and Energy
    Balasubramanian, Padmanabhan
    Maskell, Douglas L.
    ELECTRONICS, 2024, 13 (18)
  • [46] A New ACD-OMP Accelerator With Clustered Computing Look-Ahead
    She, Rongrong
    Qian, Hui
    Wang, Zhongfeng
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2023, 31 (09) : 1449 - 1453
  • [47] New look-ahead Lanczos-type algorithms for linear systems
    C. Brezinski
    M. Redivo Zaglia
    H. Sadok
    Numerische Mathematik, 1999, 83 : 53 - 85
  • [48] New look-ahead Lanczos-type algorithms for linear systems
    Brezinski, C
    Zaglia, MR
    Sadok, H
    NUMERISCHE MATHEMATIK, 1999, 83 (01) : 53 - 85
  • [49] Tissue P Systems with Look-ahead Mode
    JIANG Yun
    SONG Tao
    ZHANG Zheng
    Chinese Journal of Electronics, 2014, 23 (01) : 81 - 86
  • [50] Look-Ahead: CARBON SHOWS SUPERHARD POTENTIAL
    Schnepf, Ken
    Cutting Tool Engineering, 2020, 72 (02):