2022
DOI: 10.1101/2022.06.06.494931
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Optimisation of the core subset for the APY approximation of genomic relationships

Abstract: Background: By entering the era of mega-scale genomics, we are facing many computational issues with standard genomic evaluation models due to their dense data structure and cubic computational complexity. Several scalable approaches have have been proposed to address this challenge, like the Algorithm for Proven and Young (APY). In APY, genotyped animals are partitioned into core and non-core subsets, which induces a sparser inverse of genomic relationship matrix. The partitioning into subsets is often done a… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 44 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?