首页> 外文期刊>Genetics, selection, evolution >A rapid method for computing the inverse of the gametic covariance matrix between relatives for a marked Quantitative Trait Locus
【24h】

A rapid method for computing the inverse of the gametic covariance matrix between relatives for a marked Quantitative Trait Locus

机译:计算标记的数量性状基因座的亲戚之间配子协方差矩阵的逆的快速方法

获取原文
           

摘要

The inverse of the gametic covariance matrix between relatives, G -1, for a marked quantitative trait locus (QTL) is required in best linear unbiased prediction (BLUP) of breeding values if marker data are available on a QTL. A rapid method for computing the inverse of a gametic relationship matrix for a marked QTL without building G itself is presented. The algorithm is particularly useful due to the approach taken in computing inbreeding coefficients by having to compute only few elements of G . Numerical techniques for determining, storing, and computing the required elements of G and the nonzero elements of the inverse are discussed. We show that the subset of G required for computing the inbreeding coefficients and hence the inverse is a tiny proportion of the whole matrix and can be easily stored in computer memory using sparse matrix storage techniques. We also introduce an algorithm to determine the maximum set of nonzero elements that can be found in G -1 and a strategy to efficiently store and access them. Finally, we demonstrate that the inverse can be efficiently built using the present techniques for very large and inbred populations.
机译:如果标记上有标记数据,则最佳配种值线性无偏预测(BLUP)中需要有明显的数量性状位点(QTL)的亲戚间配子协方差矩阵G -1 的逆。 QTL。提出了一种无需构建G即可快速计算标记QTL配子关系矩阵的逆的方法。由于仅需计算G的很少几个元素就可以计算近交系数,因此该算法特别有用。讨论了用于确定,存储和计算G的必需元素和逆的非零元素的数值技术。我们表明,计算近交系数所需的G子集及其逆数仅占整个矩阵的一小部分,并且可以使用稀疏矩阵存储技术轻松存储在计算机内存中。我们还介绍了一种算法,该算法可确定可以在G -1 中找到的非零元素的最大集合,以及一种有效存储和访问它们的策略。最后,我们证明了使用本技术可以针对非常大的近交种群有效地建立逆。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号