Back
Efficient Calculation of the Genomic Relationship Matrix
Schlather, M.
2020-01-14
bioinformatics
10.1101/2020.01.12.903146
bioRxiv
Show 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.
Matching journals
●Non-profit
◐University press
○Commercial
The top 4 journals account for 50% of the predicted probability mass.
1
Bioinformatics
◐
1204 papers in training set
Top 1%
19.1%
Similar papers in this journal
2
BMC Bioinformatics
○
457 papers in training set
Top 0.2%
15.6%
Similar papers in this journal
- GPU Accelerated Adaptive Banded Event Alignment for Rapid Comparative Nanopore Signal Analysis 96%
- CUDASW++4.0: Ultra-fast GPU-based Smith-Waterman Protein Sequence Database Search 95%
- MaBoSS for HPC environments: Implementations of the continuous time Boolean model simulator for large CPUclusters and GPU accelerators 95%
4
PLOS Computational Biology
●
1863 papers in training set
Top 7%
5.3%
Similar papers in this journal
50% of probability mass above
"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.