Page 323 - Linear Models for the Prediction of Animal Breeding Values 3rd Edition

AN = i
i
l = 1
ii
D = [0.5 − 0.25(F + F )], if both parents are known; otherwise use appropriate
ii si di
the formula (see Chapter 2)
Do while AN is not empty.
i
j = max(AN ), (j = youngest animal in AN )
i i
If s is known, add s to AN :
j j i
l = l + 0.5l
is j is j ij
If d is known, add d to AN :
j j i
l = l + 0.5l
id j id j ij
a = a + l D
2
ii ii ij jj
Delete j from AN
i
End while:
F = a − 1
i ii
B.1.1 Illustration of the algorithm
Using the pedigree in Table 2.1, the algorithm is illustrated for animals 1 and 5.
For animal 1:
a = 0
11
AN = 1, l = 1
1 11
Since both parents are unknown:
D = 1
11
Processing animals in AN :
1
j = max(AN ) = 1
1
Both parents of j are unknown:
2
2
a = a + l D = (1 )1 = 1
11 11 11 11
Delete animal 1 from AN ; AN is now empty.
1 1
F = 1 − 1 = 0
1
For animal 5:
a = 0
55
AN = 5, l = 1
5 55
D = 0.5, since neither parent is inbred.
55
Processing animals in AN :
5
j = max(AN ) = 5
5
Add sire and dam of 5 (animals 4 and 3) to AN :
5
l = l + 0.5l = 0.5
54 54 55
l = l + 0.5l = 0.5
53 53 55
2
a = a + l D = 1 (0.5) = 0.5
2
55 55 55 55
Appendix B 307