Efficient Breeding by Genomic Mating

被引:64
作者
Akdemir, Deniz [1 ]
Sanchez, Julio I. [2 ]
机构
[1] Cornell Univ, Plant Breeding & Genet, Ithaca, NY 14850 USA
[2] Univ Coll Dublin, Sch Agr & Food Sci Agr & Food Sci, Dublin, Ireland
关键词
breeding; complex traits; genomic selection; phenotypic selection; genome-wide markers; MATE SELECTION; HYBRID PERFORMANCE; PEDIGREE; PREDICTION; MAIZE; OPTIMIZATION; INFORMATION; DOMINANCE; PROGRAMS; SET;
D O I
10.3389/fgene.2016.00210
中图分类号
Q3 [遗传学];
学科分类号
071007 ; 090102 ;
摘要
Selection in breeding programs can be done by using phenotypes (phenotypic selection), pedigree relationship (breeding value selection) or molecular markers (marker assisted selection or genomic selection). All these methods are based on truncation selection, focusing on the best performance of parents before mating. In this article we proposed an approach to breeding, named genomic mating, which focuses on mating instead of truncation selection. Genomic mating uses information in a similar fashion to genomic selection but includes information on complementation of parents to be mated. Following the efficiency frontier surface, genomic mating uses concepts of estimated breeding values, risk (usefulness) and coefficient of ancestry to optimize mating between parents. We used a genetic algorithm to find solutions to this optimization problem and the results from our simulations comparing genomic selection, phenotypic selection and the mating approach indicate that current approach for breeding complex traits is more favorable than phenotypic and genomic selection. Genomic mating is similar to genomic selection in terms of estimating marker effects, but in genomic mating the genetic information and the estimated marker effects are used to decide which genotypes should be crossed to obtain the next breeding population.
引用
收藏
页数:12
相关论文
共 56 条
[41]  
Meuwissen THE, 2001, GENETICS, V157, P1819
[42]  
Nduwumuremyi A., 2013, Journal of Plant Breeding and Genetics, V1, P117
[43]   BLUP for phenotypic selection in plant breeding and variety testing [J].
Piepho, H. P. ;
Moehring, J. ;
Melchinger, A. E. ;
Buechse, A. .
EUPHYTICA, 2008, 161 (1-2) :209-228
[44]   Novel strategies to minimize progeny inbreeding while maximizing genetic gain using genomic information [J].
Pryce, J. E. ;
Hayes, B. J. ;
Goddard, M. E. .
JOURNAL OF DAIRY SCIENCE, 2012, 95 (01) :377-388
[45]   ADDITIVE GENETIC MODEL WITH GROUPS AND RELATIONSHIPS [J].
QUAAS, RL .
JOURNAL OF DAIRY SCIENCE, 1988, 71 (05) :1338-1345
[46]   Maximizing the Reliability of Genomic Selection by Optimizing the Calibration Set of Reference Individuals: Comparison of Methods in Two Diverse Groups of Maize Inbreds (Zea mays L.) [J].
Rincent, R. ;
Laloe, D. ;
Nicolas, S. ;
Altmann, T. ;
Brunel, D. ;
Revilla, P. ;
Rodriguez, V. M. ;
Moreno-Gonzalez, J. ;
Melchinger, A. ;
Bauer, E. ;
Schoen, C-C ;
Meyer, N. ;
Giauffret, C. ;
Bauland, C. ;
Jamin, P. ;
Laborde, J. ;
Monod, H. ;
Flament, P. ;
Charcosset, A. ;
Moreau, L. .
GENETICS, 2012, 192 (02) :715-+
[47]   Controlling inbreeding and maximizing genetic gain using semi-definite programming with pedigree-based and genomic relationships [J].
Schierenbeck, S. ;
Pimentel, E. C. G. ;
Tietze, M. ;
Koerte, J. ;
Reents, R. ;
Reinhardt, F. ;
Simianer, H. ;
Koenig, S. .
JOURNAL OF DAIRY SCIENCE, 2011, 94 (12) :6143-6152
[48]   Molecular marker-based prediction of hybrid performance in maize using unbalanced data from multiple experiments with factorial crosses [J].
Schrag, Tobias A. ;
Moehring, Jens ;
Maurer, Hans Peter ;
Dhillon, Baldev S. ;
Melchinger, Albrecht E. ;
Piepho, Hans-Peter ;
Sorensen, Anker P. ;
Frisch, Matthias .
THEORETICAL AND APPLIED GENETICS, 2009, 118 (04) :741-751
[49]   Genomic selection requires genomic control of inbreeding [J].
Sonesson, Anna K. ;
Woolliams, John A. ;
Meuwissen, Theo H. E. .
GENETICS SELECTION EVOLUTION, 2012, 44
[50]   Mating programs including genomic relationships and dominance effects [J].
Sun, C. ;
VanRaden, P. M. ;
O'Connell, J. R. ;
Weigel, K. A. ;
Gianola, D. .
JOURNAL OF DAIRY SCIENCE, 2013, 96 (12) :8014-8023