A fast Newton–Raphson based iterative algorithm for large scale optimal contribution selection

Table 3 Analysis of the Pig dataset using Gencont2 and Gencont

\(\Delta F\)	\(\Delta G\) ^a	Ave_relationship^b	Number of selected candidates^a	Time^c	R^d
0.05	129.55	0.28481	28	6.8	0.999
0.01	125.43 (125.39)	0.21259	73 (77)	6.5	0.986
0.005	124.37 (124.42)	0.20356	84 (90)	8.2	0.986
0.001	123.40 (123.44)	0.19634	103	9.3	0.990

Different levels of rate of inbreeding with respect to genetic gain (\(\Delta G\)), number of selected individuals relative necessary computation time and correlation between assigned contributions
^aIf there was a difference between the two algorithms, the result obtained with Gencont is shown in parentheses
^bAverage relationship between selected candidates
^cAmount of computation time necessary for Gencont2 expressed as the fraction of the time necessary for Gencont (in %)
^dCorrelation between assigned contributions

ISSN: 1297-9686