HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Interpretive Summary Alert me when this article is cited Alert me if a correction is posted Services Related articles in JDS Similar articles in this journal Similar articles in PubMed Alert me to new issues of the journal Download to citation manager Google Scholar Articles by Misztal, I. Articles by Aguilar, I. PubMed PubMed Citation Articles by Misztal, I. Articles by Aguilar, I.

Computing procedures for genetic evaluation including phenotypic, full pedigree, and genomic information

I. Misztal^*,1, A. Legarra and I. Aguilar^*,

^* Department of Animal and Dairy Science, University of Georgia, Athens 30602
Institut National de la Recherche Agronomique (INRA), UR631 SAGA, BP 52627, 32326 Castanet-Tolosan, France
Instituto Nacional de Investigación Agropecuaria, Las Brujas 90200, Uruguay

¹ Corresponding author: ignacy{at}uga.edu

Currently, genomic evaluations use multiple-step procedures, which are prone to biases and errors. A single-step procedure may be applicable when genomic predictions can be obtained by modifying the numerator relationship matrix A to H = A + A, where A includes deviations from expected relationships. However, the traditional mixed model equations require H^–1, which is usually difficult to obtain for large pedigrees. The computations with H are feasible when the mixed model equations are expressed in an alternate form that also applies for singular H and when those equations are solved by the conjugate gradient techniques. Then the only computations involving H are in the form of Aq or Aq, where q is a vector. The alternative equations have a nonsymmetric left-hand side. Computing Aq is inexpensive when the number of nonzeros in A is small, and the product Aq can be calculated efficiently in linear time using an indirect algorithm. Generalizations to more complicated models are proposed. The data included 10.2 million final scores on 6.2 million Holsteins and were analyzed by a repeatability model. Comparisons involved the regular and the alternative equations. The model for the second case included simulated A. Solutions were obtained by the preconditioned conjugate gradient algorithm, which works only with symmetric matrices, and by the bi-conjugate gradient stabilized algorithm, which also works with nonsymmetric matrices. The convergence rate associated with the nonsymmetric solvers was slightly better than that with the symmetric solver for the original equations, although the time per round was twice as much for the nonsymmetric solvers. The convergence rate associated with the alternative equations ranged from 2 times lower without A to 3 times lower for the largest simulated A. When the information attributable to genomics can be expressed as modifications to the numerator relationship matrix, the proposed methodology may allow the upgrading of an existing evaluation to incorporate the genomic information.

Key Words: best linear unbiased predictor • genomic selection • single nucleotide polymorphism • genetic evaluation

Related articles in JDS:

A relationship matrix including full pedigree and genomic information

A. Legarra, I. Aguilar, and I. Misztal
JDS 2009 92: 4656-4663. [Abstract] [Full Text]