Format

Send to

Choose Destination
Genet Sel Evol. 2011 Jan 20;43(1):4. doi: 10.1186/1297-9686-43-4.

An algorithm for efficient constrained mate selection.

Author information

1
School of Environmental and Rural Science, Universiy of New England, Armidale, NSW 2350, Australia. bkinghor@une.edu.au

Abstract

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.

PMID:
21251244
PMCID:
PMC3037843
DOI:
10.1186/1297-9686-43-4
[Indexed for MEDLINE]
Free PMC Article

Supplemental Content

Full text links

Icon for BioMed Central Icon for PubMed Central
Loading ...
Support Center