J. Anim Sci.
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
QUICK SEARCH:   [advanced]


     

J. Anim Sci. 2006. 84:3212-3218. doi:10.2527/jas.2006-145
© 2006 American Society of Animal Science
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Hinrichs, D.
Right arrow Articles by Meuwissen, T. H. E.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Hinrichs, D.
Right arrow Articles by Meuwissen, T. H. E.

ANIMAL GENETICS

An algorithm to compute optimal genetic contributions in selection programs with large numbers of candidates

D. Hinrichs*,1, M. Wetten{dagger} and T. H. E. Meuwissen*

* Department of Animal and Aquacultural Sciences, Norwegian University of Life Sciences; and {dagger} Aqua Gen AS, 7462 Trondheim, Norway

1 Corresponding author: dirk.hinrichs{at}umb.no

A novel algorithm, OCSELECT, is presented for the calculation of optimal genetic contributions with a restricted rate of inbreeding when the number of selection candidates is very large. The calculation of optimal genetic contributions requires the relationship matrix between the candidates and its inverse. The relationship matrix was written as: A = ZApZ' + D, where Ap is the relationship matrix of the parents, D is a diagonal matrix of Mendelian sampling variances, and Z contains genetic contributions from parents to offspring. Therefore, A–1 = d–1 – d–1Z(Z'd–1Z + AP–1)–1 Z'd–1, requires only inversion of matrices of the size of the number of parents instead of the number of offspring. The new algorithm was compared with the software package GENCONT on a salmon data set containing 39,214 selection candidates and 45,846 pedigreed fish in total. Because GENCONT could not handle such a large data set, this data set was split into 19 smaller data sets. Both algorithms gave the same solution with respect to the genetic gain and very similar solutions with respect to the number of selected animals. The OCSELECT algorithm was able to calculate the optimal contributions for the complete data set of 39,214, and therefore no preselection of the 39,214 fish was necessary before entering the fish into the new optimal contribution selection procedure.

Key Words: genetic contribution • genetic gain • inbreeding • salmon breeding • optimal selection






HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2006 by the American Society of Animal Science.