Skip to main content

Table 6 Analysis of the Pig dataset with 2929 selection candidates under different combinations of restrictions on the minimum and maximum contributions with respect to genetic gain and optimal number of candidates to select

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

\(Cmin\)

\(Cmax\)

\(\Delta G\) a

Number of selected animalsa

0.0025

125.42 (125.39)

62 (68)

0.0050

125.34 (125.36)

48 (55)

0.01

123.77 (123.76)

102

0.02

124.97 (124.90)

84 (86)

0.03

125.19 (125.18)

81

0.04

125.34 (125.32)

78 (79)

0.05

125.37

77

0.0025

0.01

123.754

101

0.0025

0.02

125.05 (124.90)

76 (78)

0.0025

0.03

125.24 (125.18)

71 (73)

0.0025

0.04

125.33 (125.32)

70 (71)

0.0025

0.05

125.37

69

0.0050

0.01

124.97

100

0.0050

0.02

125.05 (124.90)

71

0.0050

0.03

125.24 (125.27)

66 (67)

0.0050

0.04

125.32

62

0.0050

0.05

125.54 (125.36)

56 (58)

0.0090

0.009

122.45 (122.36)

110

  1. \(Cmin\) = minimum contribution
  2. \(Cmax\) = maximum contribution
  3. \(\Delta F = 0.01\)
  4. aIf there was a difference between the two algorithms, the result obtained with Gencont is shown in parentheses