Exploiting Low-Rank Structure in Genomic Relationship Matrices for Computationally Efficient Optimum Contribution Selection
Motivation Optimum contribution selection (OCS) maximizes genetic gain under a constraint on relatedness. Genomic relationship matrices are dense, so the quadratic term costs O(n3) operations, and existing OCS software assumes pedigree sparsity. Results We replace the relationship matrix by its leading eigen-pairs, com...