Skip to main content
Journal of Animal Science logoLink to Journal of Animal Science
. 2022 Sep 7;101:skac272. doi: 10.1093/jas/skac272

Extension of the reduced animal model to single-step methods

Mohammad Ali Nilforooshan 1,
PMCID: PMC9901271  PMID: 36069946

Abstract

For a few decades, animal models (AMs) in the form of best linear unbiased prediction (BLUP) have been used for the genetic evaluation of animals. An equation system is set in the order of all the effects in the model, including all the animals in the pedigree. Solving these large equation systems has been a challenge. Reduced AM (RAM) was introduced in 1980, which allowed setting up equations for parents instead of all animals. That greatly reduced the number of equations to be solved. The RAM is followed by a back-solving step, in which progenies’ breeding values are obtained conditional on parental breeding values. Initially, pedigree information was utilized to model genetic relationships between animals. With the availability of genomic information, genomic BLUP (GBLUP), single-step GBLUP (ssGBLUP), and single-step marker models were developed. Single-step methods utilize pedigree and genomic information for simultaneous genetic evaluation of genotyped and nongenotyped animals. There has been a shortage of studies on RAM development for genetic evaluation models utilizing genomic information. This study extended the concept of RAM from BLUP to the single-step methods. Using example data, three RAMs were described for ssGBLUP. The order of animal equations was reduced from the total number of animals to (1) genotyped animals and nongenotyped parents, (2) genotyped animals and nongenotyped phenotyped animals, and (3) genotyped animals and nongenotyped parents of phenotyped nongenotyped nonparents. Solutions for the remaining animals are obtained following a back-solving step. All the RAMs produced identical results to the full ssGBLUP. Advances in computational hardware have alleviated many computational limitations, but, on the other hand, the size of data is growing rapidly by the number of animals, traits, phenotypes, genotypes, and genotype density. There is an opportunity for a RAM comeback for the single-step methods to reduce the computational demands by reducing the number of equations.

Keywords: animal model, genotyped, parents, phenotyped, reduced model, single-step


Reduced animal models used to reduce computational demands for best linear unbiased prediction (BLUP) are now applicable to single-step genomic BLUP.

Introduction

Since a few decades ago, animal genetic evaluations have been performed using “animal model” (AM) in the form of best linear unbiased prediction (BLUP; Henderson, 1975), taking into account genetic relationships between animals via pedigree information. With the availability of commercial genotyping platforms for livestock species, genomic BLUP (GBLUP; VanRaden, 2008) was developed, which was limited to information on genotyped animals. Followed by GBLUP, single-step methods were developed to incorporate pedigree and genomic information for simultaneous genetic evaluation of genotyped and nongenotyped animals. Single-step comes in the two forms of AM, called single-step GBLUP [ssGBLUP (Aguilar et al., 2010, Christensen and Lund, 2010)] and marker model (Fernando et al., 2014, 2016).

Worldwide, many genetic evaluation centers perform BLUP and single-step evaluations [ssGBLUP or single-step marker model (ssMM)] alongside each other, mainly for validation purposes and for qualifying their genomic data. Theoretically, genetic evaluation of animals unrelated to genotyped animals and their relatives remains intact in ssGBLUP compared with BLUP. However, minor differences are expected due to possibly different convergence behavior of BLUP and ssGBLUP equations (Vandenplas et al., 2018).

The concept of a reduced model (an equivalent to the full model) was first introduced to animal breeding by Henderson (1974), who absorbed equations for fixed effects into equations for sire effects. Quaas and Pollak (1980) took the reduced model to the next level by absorbing equations for random effects [reduced animal model (RAM)]. RAM allowed equations to be set up for parents in the mixed-model equations (MME). Since the number of parents is less than the number of progeny in most livestock populations, the order of equations to be formed and solved was greatly reduced (Mrode, 2005). This came with the huge benefit of reducing computational demands, given the computational limitations at the time. After solving RAM MME for breeding values of parents, breeding values of nonparents are obtained via back-solving predicted parental breeding values. The back-solving procedure is simpler and computationally less demanding than obtaining breeding values of nonparents via solving the MME for the full AM.

There have been tremendous advances in computational hardware, but on the other hand, data sizes used in genetic evaluations have increased considerably, mainly by larger pedigrees, more traits and phenotypes, and the incorporation of genomic data in genetic evaluations (VanRaden, 2008, Aguilar et al., 2010, Christensen and Lund, 2010, Fernando et al., 2014, 2016). There is an opportunity for RAM to reduce computational demands for modern (single-step) genetic evaluations.

Nilforooshan and Garrick (2021) introduced another RAM, which reduces the number of equations to phenotyped animals for BLUP, genotyped phenotyped animals for GBLUP, and genotyped animals and nongenotyped phenotyped animals for ssGBLUP. A back-solving step follows the RAM to calculate breeding values for animals not included in the MME. The aim of this technical note is to demonstrate the development of RAM for single-step methods, with numerical examples for ssGBLUP.

Materials

The example data, code (written in the R programming language), and results of this study are publicly available (Nilforooshan, 2022).

Ethical statement

No Animal Care and Use Committee approvals were required for this study because example data were used.

Data

The sample pedigree is illustrated in Figure 1, in which animals with odd numbers are females and animals with even numbers are males. Animals 5 and 10 are genotyped. Let us consider the genomic relationship matrix for these animals as

Figure 1.

Figure 1.

Pedigree structure. Genotyped animals are in dashed circles, and phenotyped animals are in a gray background.

G=[ 0.96  0.56  0.561.16].

The phenotypes were 5.64, 4.30, 4.32, 5.39, 7.72, and 4.36 for animals 4, 5, 9, 10, 11, and 12, respectively. Genetic and residual variances were considered to be 1 and 2, respectively.

Methods

Pedigree pruning

Animals with no genetic information flow with genotyped animals might be discarded from the analysis. Breeding values of those animals are independent of genomic information and can be obtained via BLUP. Animal 3 in the example pedigree (Figure 1) is a removal candidate. Expressing the inverse of the pedigree-based additive genetic relationship matrix (A−1) as

A1=[ A00  000 0A44  A430 0A34A33  A32 00A23A22 ], (1)

where genotyped animals are denoted as 2, rows and columns corresponding to A00 can be discarded. A33 contains nongenotyped animals that are parent, or progeny, or mate to a genotyped animal, and A44 contains nongenotyped animals that are parent, or progeny, or mate to an animal in A33. Grouping

[ A44  A43  A34A33]

into A11, H−1 (the inverse of the augmented pedigree- and genomic-based additive genetic relationship matrix) is reduced from

[ A00   0 0 0A11  A12 0A21H22 ] to [ A11  A12 A21H22 ],

where H22=A22+G1A221,y=[y0y1y2] is reduced to [y1y2],X=[X0X1X2] is reduced to [X1X2],

Z=[ Z0  00 0Z1   0 00Z2] is reduced to [ Z1  0 0Z2 ],

and

R1=[ R00   0 0  0R11   0  0 0R22 ] is reduced to [ R11   0  0R22 ].

It is assuming no or negligible changes in the solution of fixed effects available in X1 and X2.

The ssGBLUP MME is written as

[ XR1X        XR1Z ZR1XZR1Z+H1σa2 ][ b^ a^ ]=[ XR1y  ZR1y], (2)

where y is the vector of phenotypes, X is the incidence matrix relating y to fixed effects, Z is the incidence matrix relating y to animals, R is the diagonal matrix of residual variance(s) corresponding to y, σa2 is the additive genetic variance, b^ is the vector of fixed effect solutions, and a^ is the vector of animals’ additive genetic merit solutions.

Method 1

The RAM method of Quaas and Pollak (1980) for BLUP involves applying yp=Xpb+Zpap+ep for parents (p) and yn=Xnb+Znap+en for nonparents (n), where Zn is an incidence matrix of zeros and halves identifying the parents of animals (Mrode, 2005). This matrix has rows corresponding to phenotyped n, and columns corresponding to p. Considering

X=[XpXn],W=[ZpZn],R1=[Rpp   0  0  Rnn],Rnn=(Rnn+Dnnσa2)1,

and Dnn being a diagonal block of the diagonal matrix D, where A=TDT, the RAM is written as

[ XR1X          XR1W WR1X   WR1W+App1σa2][b^a^p]=[ XR1y WR1y ]. (3)

Compared with the full AM, W, R1, and App1 replace

Z=[ Zp  0 0  Zn], R1=[ Rpp   0  0  Rnn], and A1=[ App  Apn Anp  Ann ],

respectively. The difference between Rnn and Rnn is the absorption of the Mendelian Sampling term into the residual term (i.e., ei=MSi+ei) for Rnn (Mrode, 2005). Whereas, all animals are directly evaluated by AM (i.e., a^=[a^p  a^n]), parents are directly evaluated by RAM (i.e., a^p), and solutions for nonparents (a^n) are obtained indirectly via back-solving:

a^n=B(ynXnb^(a^s+a^d)/2)+(a^s+a^d)/2,B=(Rnn+Dnnσa2)1Rnn, (4)

where s and d are sire and dam of n. Matrix B can be simplified to (I+RnnDnnσa2)1. To extend RAM to ssGBLUP, let us split animals into the three groups of genotyped animals (2), nongenotyped parents (m), and others (n). Combining m and 2 in p, Equation (2) can be written as

[ XR1X      XpRppZp         XnRnnZn ZpRppXpZpRppZp+Hppσa2           Apnσa2 ZnRnnXn          Anpσa2  ZnRnnZn+Annσa2][b^a^pa^n]=[XR1yZpRppypZnRnnyn], (5)

where

Hpp=App+[ 0         0 0   G1A221],App=[ Amm Am2  A2m  A22],a^p=[a^ma^2],Zp=[ Zm  0  0  Z2],andRpp=[ Rmm   0   0  R22 ].

Following Quaas and Pollak (1980), Equation (5) is reduced to

[XR1X        XR1WWR1X  WR1W+Hpp1σa2][b^a^p]=[XR1yWR1y], (6)

where

Hpp1=App1+[0         00   G1A221],

and

App=[Amm  Am2A2m  A22].

Both A221 and App1 are derived using the fast algorithm of Faux and Gengler (2013), which works based on pedigree searching for dependencies between selected animals or the method of Colleau (2002). Back-solving a^n is done using Equation (4). The reason for keeping nonparent genotyped animals in RAM is to keep the subsequent back-solving free from the blocks of G1. Otherwise, RAM would be computationally unjustifiable.

Method 2

This method (Nilforooshan and Garrick, 2021) reduces AM for ssGBLUP to genotyped animals and nongenotyped phenotyped animals. Splitting animals to genotyped, nongenotyped phenotyped (m), and nongenotyped nonphenotyped (n), and combining m and 2 in p, Equation (2) can be written as

[ XR1X      XpRppZp         XnRnnZn ZpRppXpZpRppZp+Hppσa2           Apnσa2 ZnRnnXn          Anpσa2  ZnRnnZn+Annσa2]×[b^a^pa^n]=[XR1yZpRppypZnRnnyn], (7)

where Z=[Zp  0], and matrix 0 corresponds to the columns of Z for animals n. The above equation can be reduced to

[XR1X         XR1ZpZpR1X   ZpR1Zp+Φσa2]×[b^a^p]=[XR1yZpR1y], (8)

where

Φ =HppApn(Ann)1Anp=HppApp+App1=App1+[0         00   G1A221]=Hpp1.

Back-solving for a^n solutions is done by solving

Anna^n=Anpa^p. (9)

Method 3

This method further reduces the RAM created by Method 1. Consider the RAM presented in Equation (6). Dividing p (genotyped animals and nongenotyped parents) into genotyped animals and nongenotyped parents of phenotyped nongenotyped nonparents (q), and nongenotyped parents not parent to any phenotyped nongenotyped nonparent animal (r), Equation (6) can be written as

[XR1X        XR1Wq     0WqR1X  WqR1Wq+Ψqqσa2  Ψqrσa2     0          Ψrqσa2  Ψrrσa2]×[b^a^qa^r]=[ XR1yWqR1y     0], (10)

where W=[Wq  0],Wq contains columns of W corresponding to q, and Ψ=Hpp1. Next, the above equation system is reduced to

[   XR1X         XR1WqWqR1X  WqR1Wq+Ωσa2 ]×[b^a^q]=[XR1yWqR1y], (11)

where Ω=(Ψ1)qq1=(Hpp)qq1=Hqq1. As such, the two-step reduction can be made at once with a one-step reduction to q. Back-solving a^n (solutions for nongenotyped nonparents) is done according to Equation (4), and back-solving for a^r solutions is done similar to Equation (9), by solving Arra^r=Arqa^q.

Extension to the single-step marker model

Fernando et al. (2014) developed ssMM, an equivalent model to ssGBLUP, which uses imputed marker covariates for nongenotyped animals and a residual genetic effect accommodating deviations between imputed and true genotypes. Including an additive polygenic effect not captured by the markers (residual polygenic effect) into the marker model presented in Equation (3) of Fernando et al. (2016):

[   XR1X       XR1ZM       X1R11Z1     XR1Z MZR1X  MZR1ZM+Iσα2   M1Z1R11Z1      MZR1Z  Z1R11X1      Z1R11Z1M1  Z1R11Z1+A11σα2   [Z1R11Z1  0]  ZR1X       ZR1ZM    [Z1R11Z1  0]  ZR1Z+A1σδ2]                   [b^α ^ϵ^δ ^]=[ XR1yMZR1y Z1R11y1 ZR1y] (12)

where

X=[X1X2], y=[y1y2], Z=[Z1  00  Z2], M=[M1M2],

M 2 is the observed and centered genotype matrix for genotyped animals, M1 is the imputed genotype matrix for nongenotyped animals derived by solving A11M1 = −A12M2, σα2 is the additive genetic variance of marker effects, σδ2 is the residual polygenic variance, α^ is the vector of marker effect solutions, ϵ^ is the vector of predictions for the deviations between the true and estimated (imputed) marker breeding values for nongenotyped animals, and δ^ is the vector of animal’s residual polygenic effect solutions.

Method 1

Applying Method 1 to Equation (12), the ssMM is reduced to genotyped animals and nongenotyped parents (p). Thus, A−1 is replaced with App1,A11 with (App1)(1p)(1p)=App(1p)(1p),A12 with (App1)(1p)2=App(1p)2,Rnn with Rnn, and Z1 with W1. Consequently, matrices made up of these matrices will change as well.

Back-solving for nongenotyped nonparents (n) is done by extending Equation (4) to

[a^nϵ^n]=[B  00  B][ynXnb^(a^s+a^d)/2ynXnb^(ϵ^s+ϵ^d)/2]+12[a^s+a^dϵ^s+ϵ^d]. (13)

If in is not phenotyped, yiXib^ is replaced with (a^s+a^d)/2. If the sire of in is genotyped, ϵ^si=0.

Method 2

Applying Method 2 to Equation (12), the ssMM is reduced to genotyped animals and nongenotyped phenotyped animals (p). Thus, A−1 is replaced with App1,A11 with (App1)(1p)(1p)=App(1p)(1p),A12 with (App1)(1p)2=App(1p)2, and Z1 with Z1p. Consequently, matrices made up of these matrices will change too.

Back-solving for nongenotyped nonphenotyped animals (n) is performed by solving

[Ann    00  Ann][a^nϵ^n]=[Anp    00  Anp][a^pϵ^p]. (14)

Method 3

Applying Method 3 to Equation (12), the ssMM is reduced to genotyped animals and nongenotyped parents of ­phenotyped nongenotyped nonparents (q). Thus, A−1 is replaced with Aqq1,A11 with (Aqq1)(1q)(1q)=Aqq(1q)(1q),A12 with (Aqq1)(1q)2=Aqq(1q)2,Rnn with Rnn, and Z1 with W1q. Consequently, matrices made up of these matrices will change too.

Back-solving for nongenotyped nonparents (n) is done according to Equation (13), and back-solving for nongenotyped parents, not parent to any phenotyped nongenotyped nonparent animal (r) is done by solving

[Arr    0 0   Arr][a^rϵ^r]=[Arq   00  Arq][a^qϵ^q].

Results

Full animal model

The ssGBLUP MME for the full AM was formed and solved to check the correctness of the RAM solutions. Where applicable, columns/rows of matrices/vectors corresponding to animals are presented with animal identification indices. Where column and row indices are the same, only column indices are presented. The required matrices to form the MME were

A1=16     1      2       3      4       5     6     7     8     9     10    11    12[8004  0000000001000440000000080004  0000040016303460060403143006600040031430066000430314000660004000800000006600012000000066000120000000660001200006006000012]
H1=A1+[0        00  G1A221],G1=   5  10[1.450.7 0.7   1.2],A221=    5        10[1.53190.8511  0.8511    1.3617],y =   4[5.64    5  4.30    9  4.32   10  5.39   11  7.72    12  4.36],
Z= 1  2  3  4  5  6  7  8  9 10 1112[0  0  0  1  0  0  0  0  0  0  0  00  0  0  0  1  0  0  0  0  0  0  00  0  0  0  0  0  0  0  1  0  0  00  0  0  0  0  0  0  0  0  1  0  00  0  0  0  0  0  0  0  0  0  1  00  0  0  0  0  0  0  0  0  0  0  1]459101112
X= 4  5  9  10 11 12[1  1  1  1  1  10  1  1  0  1  0]μsex,
R1=I6σe2,

where σe2 is the residual variance. Solving Equation (2) returns

b^=[5.19380.3287],a^=[0.04760.04140.10400.09530.43020.32680.20800.04760.45070.02550.65340.1217]123456789101112.

RAM: Method 1

Reducing AM to genotyped animals and nongenotyped parents (p={17,  10}), nongenotyped nonparents (n = {8, 9, 11, 12}) are excluded from the model. Changing from AM to RAM, R1 replaces R1,W replaces Z, and Hpp1 replaces H−1, where

Dnn= 9   11  12diag(0.5  0.5  0.5)
Rnn=  9   11   12diag(0.4  0.4  0.4)
W=  1  2  3  4   5   6   7  10[0  0  0  1  0  0  0  00  0  0  0  1  0  0  00  0  0 0.5 0.5  0  0  00  0  0  0  0  0  0  10  0  0  0  0 0.5 0.5  00  0  0 0.5  0  0 0.5  0]459101112,
App1=16   1   2  3   4  5  6  7  10[80040000010004400008000404008000004001130604003110600400080000066012],
Hpp1=App1+[0        00  G1A221].

Note that even though 8n, because it has no phenotype, it has no designated rows and columns in Dnn, Rnn, and rows in W. Solving Equation (6) returns

b^=[5.19380.3287],a^p=[0.04760.04140.10400.09530.43020.32680.20800.0255]123456710

Back-solving involves Equation (4), where

B=111diag891112(32.22.22.2)
(ynXnb^)=       8[(a^s8+a^d8)/2        9  1.2025     11  2.1975       12  0.8338],
a^s=      8[0.0953        9 0.0953     11  0.3268       12  0.0953],
a^d=8[0       9 0.4302     11  0.2080     12  0.2080],

and returns

a^n=      8[0.0476         9  0.4507     11  0.6534        12  0.1217].

Notice that for nonphenotyped animal in,(a^si+a^di)/2 is assigned to yiXib^.

RAM: Method 2

Reducing AM to genotyped animals and nongenotyped phenotyped animals (p={4, 5, 912}), nongenotyped nonphenotyped animals (n = {1, 2, 3, 6, 7, 8}) are excluded from the model. Changing from AM to RAM, Zp replaces Z, and Hpp1 replaces H−1, where

Zp=  4  5  9 10 11 12[1  0  0  0  0  00  1  0  0  0  00  0  1  0  0  00  0  0  1  0  00  0  0  0  1  00  0  0  0  0  1],
App1=        4             5         9         10           11            12[1.86700.515010.06440.20170.73390.51502.038610.87980.09010.03001120000.06440.879801.48500.38630.12880.20170.090100.38631.21030.40340.73390.030000.12880.40341.4678],
Hpp1=App1+[0        00  G1A221].

Solving Equation (8) returns

b^=[5.19380.3287],a^p=[0.09530.43020.45070.02550.65340.1217]459101112.

Back-solving involves Equation (9), and returns

a^n=      1        2      3     6      7       8[0.0476 0.0414  0.1040  0.3268  0.2080 0.0476].

RAM: Method 3

Reducing AM to genotyped animals and nongenotyped parents of phenotyped nongenotyped nonparents (q={47,10}), nongenotyped nonparents (n={8,9,11,12}) and nongenotyped parents not parent to any phenotyped nongenotyped nonparent animal (r = {1, 2, 3}) are excluded from the model. Changing from AM to RAM, R1 replaces R1, Wq replaces Z, and Hqq1 replaces H1, where

Wq=   4    5    6    7  10[ 1   0  0   0  0 0   1  0   0  00.5  0.5  0   0  0 0   0  0   0  1 0   0 0.5  0.5  00.5  0  0  0.5  0]459101112,
Aqq1=13 4   5    6    7   10[3   0   0   0   00  4.7  0.7   0 30  0.7  4.7   0 30   0   0   3   00 3 3   0   6],
Hqq1=Aqq1+[0         00   G1A221].

Solving Equation (11) returns

b^=[5.19380.3287],a^q=4[0.095350.430260.326870.2080100.0255].

Back-solving for a^n solutions involves Equation (4), and returns

a^n=8[0.047690.4507110.6534120.1217].

Back-solving for a^r solutions involves solving Arra^r=Arqa^q, and returns

a^r=1[0.047620.041430.1040].

Factors affecting the computational efficiency of RAM: A real data example

The computational efficiency of RAM depends on the size and the computational cost of deriving Aqq1 vs. A1 , and the sparsity of the rows of Aqq1 corresponding to nongenotyped animals (the block of Aqq1 corresponding to genotyped animals sums with G1A221, which is dense). With optimized computing, the computational costs of forming Wq and R1 are marginally greater than those for Z and R1 for the full AM. This is considering that the back-solving procedure should remain as simple and efficient as possible. The most important factors influencing (some with overlapping influence) the computational efficiency of the ssGBLUP RAM are (1) number of genotyped vs. nongenotyped animals, (2) number of nongenotyped parents vs. nongenotyped nonparents, (3) number of nongenotyped phenotyped vs. nongenotyped nonphenotyped animals, (4) pedigree missing rate, and (5) sparsity of the rows of Aqq1 corresponding to nongenotyped animals (influenced by the sparsity of A1).

A real data (New Zealand’s dairy cattle pedigree, May 2022) example was used to study the dimension reduction by RAM. There were 32,679,354 animals in the pedigree. Considering Equation (1), there were 243,034, 405,911, 25,759,086, and 6,335,004 animals in A22, A33, A44, and A00, respectively. Pruning the pedigree free from animals in A00, 26,344,350 animals remained in the pedigree. There were 13,980,955 nongenotyped parents in the remaining pedigree, of which 9,041,130 were parents of nongenotyped nonparents. The 243,034 genotyped animals and the 9,041,130 nongenotyped parents of nongenotyped nonparents remained for the single-step RAM. Without pedigree pruning, 243,034 genotyped animals and 10,362,206 nongenotyped parents of nongenotyped nonparents remained in the RAM. Since the aim is to keep the back-solving procedure free from genomic information, only the equations corresponding to nongenotyped animals undergo reduction. It was possible to further reduce nongenotyped parents of nongenotyped nonparents to nongenotyped parents of phenotyped nongenotyped nonparents. However, this further reduction was omitted, so that a single Aqq1 is created and used in all the analyses for different traits. Similarly, the ssMM equations (Equation (12)) corresponding to nongenotyped animals are reduced to nongenotyped parents of nongenotyped nonparents.

Discussion

Breeding values of some nongenotyped animals are not influenced and do not influence the breeding values of genotyped animals. If BLUP is performed in conjunction with single-step evaluations, those animals can be evaluated via BLUP only.

This study showed that RAM used to reduce the dimension of equations for BLUP can be easily extended to single-step genetic evaluations. Numerical results were shown for ssGBLUP, and the three RAMs produced identical solutions to the full ssGBLUP. No results were presented for the ssMM. However, as the ssMM is an equivalent form of ssGBLUP (Fernando et al., 2014, Bermann et al., 2022), indirectly evaluating animals via directly evaluating marker effects, the same principles applied to RAM for ssGBLUP are valid for the reduced ssMM. Considering Equation (12) and Method 3, the number of equations corresponding to ϵ^ reduces from the number of nongenotyped animals to nongenotyped parents of phenotyped nongenotyped nonparents, and the number of equations corresponding to δ^ reduces from the total number of animals to genotyped animals and nongenotyped parents of phenotyped nongenotyped nonparents.

Compared with RAM for BLUP, genotyped animals are present in the reduced single-step model. An efficient reduced model should be followed by an easy and fast back-solving, introducing no new information other than the conditionality of the back-solving solutions to the RAM solutions. That conditionality should be defined via sparse matrices, such as the diagonal matrix B in Methods 1 and Method 3, or blocks of A−1 in Methods 2 and 3, instead of the dense blocks of H−1.

The choice among the three RAMs depends on the number of nongenotyped animals remaining together with genotyped animals in RAM. It seems that Method 2 compromises the sparseness of App1 used in Hpp1, and that back-solving a^n is easier in Methods 1 and 3. Therefore, unless the number of nongenotyped phenotyped animals is considerably less than the number of nongenotyped parents or nongenotyped parents of phenotyped nongenotyped nonparents, Methods 1 and 3 are preferred over Method 2.

Acknowledgments

This work received financial support from the NZ Ministry for Primary Industries, SFF Futures Programme: Resilient Dairy–Innovative breeding for a sustainable dairy future (grant number: PGP06-17006).

Glossary

Abbreviations

AM

animal model

BLUP

best linear unbiased prediction

GBLUP

genomic BLUP

MME

mixed-model equations

RAM

reduced AM

ssGBLUP

single-step GBLUP

ssMM

single-step marker model

Conflict of Interest Statement

MAN is employed at Livestock Improvement Corporation, Hamilton, New Zealand. He declares that the research was conducted in the absence of any commercial or financial interests.

References

  1. Aguilar, I., Misztal I., Johnson D. L., Legarra A., Tsuruta S., and Lawlor T. J.. . 2010. Hot topic: A unified approach to utilize phenotypic, full pedigree, and genomic information for genetic evaluation of Holstein final score. J. Dairy Sci. 93:743–752. doi: 10.3168/jds.2009-2730 [DOI] [PubMed] [Google Scholar]
  2. Bermann, M., D. Lourenco, N. S. Forneris, A. Legarra, and Misztal I.. 2022. On the equivalence between marker effect models and breeding value models and direct genomic values with the Algorithm for Proven and Young. Genet. Sel. Evol. 54:52. doi: 10.1186/s12711-022-00741-7 [DOI] [PMC free article] [PubMed] [Google Scholar]
  3. Christensen, O. F., and Lund M. S.. . 2010. Genomic prediction when some animals are not genotyped. Genet. Sel. Evol. 42:2. doi: 10.1186/1297-9686-42-2 [DOI] [PMC free article] [PubMed] [Google Scholar]
  4. Colleau, J. J. 2002. An indirect approach to the extensive calculation of relationship coefficients. Genet. Sel. Evol. 34:409–421. doi: 10.1186/1297-9686-34-4-409 [DOI] [PMC free article] [PubMed] [Google Scholar]
  5. Faux, P., and Gengler N.. . 2013. Inversion of a part of the numerator relationship matrix using pedigree information. Genet. Sel. Evol. 45:45. doi: 10.1186/1297-9686-45-45 [DOI] [PMC free article] [PubMed] [Google Scholar]
  6. Fernando, R. L., Dekkers J. C., and Garrick D. J.. . 2014. A class of Bayesian methods to combine large numbers of genotyped and non-genotyped animals for whole-genome analyses. Genet. Sel. Evol. 46:50. doi: 10.1186/1297-9686-46-50 [DOI] [PMC free article] [PubMed] [Google Scholar]
  7. Fernando, R. L., Cheng H., Golden B. L., and Garrick D. J.. . 2016. Computational strategies for alternative single-step Bayesian regression models with large numbers of genotyped and non-genotyped animals. Genet. Sel. Evol. 48:96. doi: 10.1186/s12711-016-0273-2 [DOI] [PMC free article] [PubMed] [Google Scholar]
  8. Henderson, C. R. 1975. Best linear unbiased estimation and prediction under a selection model. Biometrics 31:423–447. doi: 10.2307/2529430 [DOI] [PubMed] [Google Scholar]
  9. Henderson, C. R. 1974. General flexibility of linear model techniques for sire evaluation. J. Dairy Sci. 57:963–972. doi: 10.3168/jds.S0022-0302(74)84993-3 [DOI] [Google Scholar]
  10. Mrode, R. A. 2005. Univariate models with one random effect. In: Linear models for the prediction of animal breeding values. 2nd ed. CABI Publishing, Oxfordshire, UK. p. 39–64. doi: 10.1079/9780851990002.0000 [DOI] [Google Scholar]
  11. Nilforooshan, M. A. 2022. Reduced animal model for ssGBLUP. figshare (May 28, 2022). doi: 10.6084/m9.figshare.16455681.v2. [DOI]
  12. Nilforooshan, M. A., and Garrick D.. . 2021. Reduced animal models fitting only equations for phenotyped animals. Front. Genet. 12:637626. doi: 10.3389/fgene.2021.637626 [DOI] [PMC free article] [PubMed] [Google Scholar]
  13. Quaas, R. L., and Pollak E. J.. . 1980. Mixed model methodology for farm and ranch beef cattle testing programs. J. Anim. Sci. 51:1277–1287. doi: 10.2527/jas1981.5161277x [DOI] [Google Scholar]
  14. Vandenplas, J., Eding H., Calus M. P. L., and Vuik C.. . 2018. Deflated preconditioned conjugate gradient method for solving single-step BLUP models efficiently. Genet. Sel. Evol. 50:51. doi: 10.1186/s12711-018-0429-3 [DOI] [PMC free article] [PubMed] [Google Scholar]
  15. VanRaden, P. M. 2008. Efficient methods to compute genomic predictions. J. Dairy Sci. 91:4414–4423. doi: 10.3168/jds.2007-0980 [DOI] [PubMed] [Google Scholar]

Articles from Journal of Animal Science are provided here courtesy of Oxford University Press

RESOURCES