Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

A recursive algorithm for decomposition and creation of the inverse of the genomic relationship matrix.

Journal of dairy science - 1 Oct 2012

Faux P, Gengler N, Misztal I

Abstract excerpt

Some genomic evaluation models require creation and inversion of a genomic relationship matrix (G). As the number of genotyped animals increases, G becomes larger and thus requires more time for inversion. A single-step genomic evaluation also requires inversion of the part of the pedigree relationship matrix for genotyped animals (A(22)). A strategy was developed to provide an approximation of the inverse of...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Breeding
Share to Cattle

Methodology Data sources Editorial policy Privacy Delete account & data About Contact Helena Bioinformatics

Share to Genomics

Share to Genotype

Share to Models, Genetic

Share to Pedigree

Share to Phenotype

Source

Identifiers

PMID: 22884343
DOI: 10.3168/jds.2011-5249

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 7 Sept 2026. Manifest publication-graph-cohort-2026-09-08.1.

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence. Graph snapshot: 2026-09-29.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

A recursive algorithm for decomposition and creation of the inverse of the genomic relationship matrix.PMID 22884343Read ↗

Inversion of a part of the numerator relationship matrix using pedigree information.Semantic proximity Read ↗

Using recursion to compute the inverse of the genomic relationship matrix.Semantic proximity Read ↗

Solving efficiently large single-step genomic best linear unbiased prediction models.Semantic proximity Read ↗

A fast indirect method to compute functions of genomic relationships concerning genotyped and ungenotyped individuals, for diversity management.Semantic proximity Read ↗

Is single-step genomic REML with the algorithm for proven and young more computationally efficient when less generations of data are present?Semantic proximity Read ↗

Different genomic relationship matrices for single-step analysis using phenotypic, pedigree and genomic information.Semantic proximity Read ↗

Large-scale genomic prediction using singular value decomposition of the genotype matrix.Semantic proximity Read ↗

Inexpensive Computation of the Inverse of the Genomic Relationship Matrix in Populations with Small Effective Population Size.Semantic proximity Read ↗

Implementation of genomic recursions in single-step genomic best linear unbiased predictor for US Holsteins with a large number of genotyped animals.Semantic proximity Read ↗

Sparse single-step genomic BLUP in crossbreeding schemes.Semantic proximity Read ↗

Practical implementation of genetic groups in single-step genomic evaluations with Woodbury matrix identity-based genomic relationship inverse.Semantic proximity Read ↗

Technical note: Avoiding the direct inversion of the numerator relationship matrix for genotyped animals in single-step genomic best linear unbiased prediction solved with the preconditioned conjugate gradient.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.