The L-shaped selection algorithm for multitrait genomic selection

File

2022-WangLizhi-LshapedSelectionAlgorithm.pdf (775.81 KB)

Date

2022-04-28

Authors

Amini, Fatemeh
Hu, Guiping
Wang, Lizhi
Wu, Ruoyu

Publisher

Oxford University Press

Altmetrics

Authors

Hu, Guiping

Person

Wang, Lizhi

Person

Organizational Units

Industrial and Manufacturing Systems Engineering

Organizational Unit

Electrical and Computer Engineering

Organizational Unit

Mathematics

Organizational Unit

Department

Industrial and Manufacturing Systems EngineeringElectrical and Computer EngineeringMathematics

Abstract

Selecting for multiple traits as opposed to a single trait has become increasingly important in genomic selection. As one of the most popular approaches to multi-trait genomic selection (MTGS), index selection uses a weighted average of all traits as a single breeding objective. Although intuitive and effective, index selection is not only numerically sensitive but also structurally incapable of finding certain optimal breeding parents. This paper proposes a new selection method for MTGS, the L-shaped selection, which addresses the limitations of index selection by normalizing the trait values and using an L-shaped objective function to find optimal breeding parents. This algorithm has been proven to be able to find any Pareto optimal solution with appropriate weights. Two performance metrics have also been defined to quantify MTGS algorithms with respect to their ability to accelerate genetic gain and preserve genetic diversity. Computational experiments were conducted to demonstrate the improved performance of L-shaped selection over index selection.

Comments

This article is published as Amini, Fatemeh, Guiping Hu, Lizhi Wang, and Ruoyu Wu. "The L-shaped selection algorithm for multitrait genomic selection." Genetics 221, no. 3 (2022): iyac069. DOI: 10.1093/genetics/iyac069. Copyright 2022 The Author(s). Attribution 4.0 International (CC BY 4.0). Posted with permission.