An algorithm for efficient constrained mate selection.
BACKGROUND
Mate selection can be used as a framework to balance key technical, cost and logistical issues while implementing a breeding program at a tactical level. The resulting mating lists accommodate optimal contributions of parents to future generations, in conjunction with other factors such as progeny inbreeding, connection between herds, use of reproductive technologies, management of the genetic distribution of nominated traits, and management of allele/genotype frequencies for nominated QTL/markers.


METHODS
This paper describes a mate selection algorithm that is widely used and presents an extension that makes it possible to apply constraints on certain matings, as dictated through a group mating permission matrix.


RESULTS
This full algorithm leads to simpler applications, and to computing speed for the scenario tested, which is several hundred times faster than the previous strategy of penalising solutions that break constraints.


CONCLUSIONS
The much higher speed of the method presented here extends the use of mate selection and enables implementation in relatively large programs across breeding units.
School of Environmental and Rural Science, Universiy of New England, Armidale, NSW 2350, Australia. bkinghor@une.edu.au
Brian P
BP
Kinghorn
D000465:Algorithms; D000818:Animals; D005075:Biological Evolution; D002417:Cattle; D005260:Female; D005787:Gene Frequency; D007178:Inbreeding / Q000379:methods*; D008297:Male
J Anim Sci. 1997 Apr;75(4):934-40
9110204
J Anim Sci. 1998 Oct;76(10):2575-83
9814896
J Dairy Sci. 1985 May;68(5):1302-5
3842871
Theor Appl Genet. 1980 Nov;57(6):267-72
24301147
J Dairy Sci. 1998 Sep;81 Suppl 2:55-63
9777512