bioRxivBioinformaticsPreprint
Efficient Calculation of the Genomic Relationship Matrix
Abstract
Since the calculation of a genomic relationship matrix needs a large number of arithmetic operations, fast implementations are of interest. Our fastest algorithm is more accurate and 25x faster than a AVX double precision floating-point implementation.
- Citations
- 7
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Fast computation of principal components of genomic similarity matrices
Georg Hahn, Sharon Marie Lutz, … Christoph Lange·bioRxiv·Oct 6, 2022
- On ARGs, pedigrees, and genetic relatedness matrices
Brieuc Lehmann, Hanbin Lee, … Peter L. Ralph·GeneticsPeer-reviewed·Oct 8, 2025
- Exploiting Low-Rank Structure in Genomic Relationship Matrices for Computationally Efficient Optimum Contribution Selection
Jon Ahlinder, Patrik Waldmann·bioRxiv·Oct 11, 2026
- The algorithm for proven and young (APY) from a different perspective
Mohammad Ali Nilforooshan·bioRxiv·Nov 23, 2022
- Properties Of Genomic Relationships For Estimating Current Genetic Variances Within And Genetic Correlations Between Populations
Yvonne C. J. Wientjes, Piter Bijma, … M.P.L. Calus·GeneticsPeer-reviewed·Aug 16, 2017
- Accelerated matrix-vector multiplications for matrices involving genotype covariates with applications in genomic prediction
Alexander Freudenberg, Jérémie Vandenplas, … Jan ten Napel·Frontiers in GeneticsPeer-reviewed·Aug 17, 2023