Computational strategies for the preconditioned conjugate gradient method applied to ssSNPBLUP, with an application to a multivariate maternal model

Abstract Background The single-step single nucleotide polymorphism best linear unbiased prediction (ssSNPBLUP) is one of the single-step evaluations that enable a simultaneous analysis of phenotypic and pedigree information of genotyped and non-genotyped animals with a large number of genotypes. The...

Full description

Bibliographic Details
Main Authors: Jeremie Vandenplas, Herwin Eding, Maarten Bosmans, Mario P. L. Calus
Format: Article
Language:deu
Published: BMC 2020-05-01
Series:Genetics Selection Evolution
Online Access:http://link.springer.com/article/10.1186/s12711-020-00543-9
id doaj-16062dfab70c4304801a432fce916971
record_format Article
spelling doaj-16062dfab70c4304801a432fce9169712020-11-25T02:29:22ZdeuBMCGenetics Selection Evolution1297-96862020-05-0152111010.1186/s12711-020-00543-9Computational strategies for the preconditioned conjugate gradient method applied to ssSNPBLUP, with an application to a multivariate maternal modelJeremie Vandenplas0Herwin Eding1Maarten Bosmans2Mario P. L. Calus3Animal Breeding and Genomics, Wageningen URCRV BVVORtech Scientific Software EngineersAnimal Breeding and Genomics, Wageningen URAbstract Background The single-step single nucleotide polymorphism best linear unbiased prediction (ssSNPBLUP) is one of the single-step evaluations that enable a simultaneous analysis of phenotypic and pedigree information of genotyped and non-genotyped animals with a large number of genotypes. The aim of this study was to develop and illustrate several computational strategies to efficiently solve different ssSNPBLUP systems with a large number of genotypes on current computers. Results The different developed strategies were based on simplified computations of some terms of the preconditioner, and on splitting the coefficient matrix of the different ssSNPBLUP systems into multiple parts to perform its multiplication by a vector more efficiently. Some matrices were computed explicitly and stored in memory (e.g. the inverse of the pedigree relationship matrix), or were stored using a compressed form (e.g. the Plink 1 binary form for the genotype matrix), to permit the use of efficient parallel procedures while limiting the required amount of memory. The developed strategies were tested on a bivariate genetic evaluation for livability of calves for the Netherlands and the Flemish region in Belgium. There were 29,885,286 animals in the pedigree, 25,184,654 calf records, and 131,189 genotyped animals. The ssSNPBLUP system required around 18 GB Random Access Memory and 12 h to be solved with the most performing implementation. Conclusions Based on our proposed approaches and results, we showed that ssSNPBLUP provides a feasible approach in terms of memory and time requirements to estimate genomic breeding values using current computers.http://link.springer.com/article/10.1186/s12711-020-00543-9
collection DOAJ
language deu
format Article
sources DOAJ
author Jeremie Vandenplas
Herwin Eding
Maarten Bosmans
Mario P. L. Calus
spellingShingle Jeremie Vandenplas
Herwin Eding
Maarten Bosmans
Mario P. L. Calus
Computational strategies for the preconditioned conjugate gradient method applied to ssSNPBLUP, with an application to a multivariate maternal model
Genetics Selection Evolution
author_facet Jeremie Vandenplas
Herwin Eding
Maarten Bosmans
Mario P. L. Calus
author_sort Jeremie Vandenplas
title Computational strategies for the preconditioned conjugate gradient method applied to ssSNPBLUP, with an application to a multivariate maternal model
title_short Computational strategies for the preconditioned conjugate gradient method applied to ssSNPBLUP, with an application to a multivariate maternal model
title_full Computational strategies for the preconditioned conjugate gradient method applied to ssSNPBLUP, with an application to a multivariate maternal model
title_fullStr Computational strategies for the preconditioned conjugate gradient method applied to ssSNPBLUP, with an application to a multivariate maternal model
title_full_unstemmed Computational strategies for the preconditioned conjugate gradient method applied to ssSNPBLUP, with an application to a multivariate maternal model
title_sort computational strategies for the preconditioned conjugate gradient method applied to sssnpblup, with an application to a multivariate maternal model
publisher BMC
series Genetics Selection Evolution
issn 1297-9686
publishDate 2020-05-01
description Abstract Background The single-step single nucleotide polymorphism best linear unbiased prediction (ssSNPBLUP) is one of the single-step evaluations that enable a simultaneous analysis of phenotypic and pedigree information of genotyped and non-genotyped animals with a large number of genotypes. The aim of this study was to develop and illustrate several computational strategies to efficiently solve different ssSNPBLUP systems with a large number of genotypes on current computers. Results The different developed strategies were based on simplified computations of some terms of the preconditioner, and on splitting the coefficient matrix of the different ssSNPBLUP systems into multiple parts to perform its multiplication by a vector more efficiently. Some matrices were computed explicitly and stored in memory (e.g. the inverse of the pedigree relationship matrix), or were stored using a compressed form (e.g. the Plink 1 binary form for the genotype matrix), to permit the use of efficient parallel procedures while limiting the required amount of memory. The developed strategies were tested on a bivariate genetic evaluation for livability of calves for the Netherlands and the Flemish region in Belgium. There were 29,885,286 animals in the pedigree, 25,184,654 calf records, and 131,189 genotyped animals. The ssSNPBLUP system required around 18 GB Random Access Memory and 12 h to be solved with the most performing implementation. Conclusions Based on our proposed approaches and results, we showed that ssSNPBLUP provides a feasible approach in terms of memory and time requirements to estimate genomic breeding values using current computers.
url http://link.springer.com/article/10.1186/s12711-020-00543-9
work_keys_str_mv AT jeremievandenplas computationalstrategiesforthepreconditionedconjugategradientmethodappliedtosssnpblupwithanapplicationtoamultivariatematernalmodel
AT herwineding computationalstrategiesforthepreconditionedconjugategradientmethodappliedtosssnpblupwithanapplicationtoamultivariatematernalmodel
AT maartenbosmans computationalstrategiesforthepreconditionedconjugategradientmethodappliedtosssnpblupwithanapplicationtoamultivariatematernalmodel
AT marioplcalus computationalstrategiesforthepreconditionedconjugategradientmethodappliedtosssnpblupwithanapplicationtoamultivariatematernalmodel
_version_ 1724833473220313088