Hinrichs D, Wetten M, Meuwissen T H E
Department of Animal and Aquacultural Sciences, Norwegian University of Life Sciences, Norway.
J Anim Sci. 2006 Dec;84(12):3212-8. doi: 10.2527/jas.2006-145.
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 = ZA(p)Z' + D, where A(p) 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(-1)Z(Z'd(-1)Z + A(P)(-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.
提出了一种新算法OCSELECT，用于在候选选择数量非常大时，计算具有受限近亲繁殖率的最优遗传贡献。计算最优遗传贡献需要候选个体之间的亲缘关系矩阵及其逆矩阵。亲缘关系矩阵可表示为：A = ZA(p)Z' + D，其中A(p)是亲本的亲缘关系矩阵，D是孟德尔抽样方差的对角矩阵，Z包含亲本对后代的遗传贡献。因此，A(-1) = d(-1) - d(-1)Z(Z'd(-1)Z + A(P)(-1))(-1) Z'd(-1)，只需要对亲本数量规模的矩阵求逆，而不是对后代数量规模的矩阵求逆。在一个包含总共39214个候选选择个体和45846条系谱鱼的鲑鱼数据集上，将新算法与软件包GENCONT进行了比较。由于GENCONT无法处理如此大的数据集，该数据集被拆分为19个较小的数据集。两种算法在遗传增益方面给出了相同的解决方案，在所选动物数量方面给出了非常相似的解决方案。OCSELECT算法能够计算39214个完整数据集的最优贡献，因此在将这些鱼纳入新的最优贡献选择程序之前，无需对这39214条鱼进行预选。
