Identification of relationships and pedigree simplification using graph theory

Title
Identification of relationships and pedigree simplification using graph theory
Publication Date
2025-06
Author(s)
Ferdosi, M H
( author )
OrcID: https://orcid.org/0000-0001-5385-4913
Email: mferdos3@une.edu.au
UNE Id une-id:mferdos3
Johnston, D
( author )
OrcID: https://orcid.org/0000-0002-4995-8311
Email: djohnsto@une.edu.au
UNE Id une-id:djohnsto
Editor
Editor(s): Sue Hatcher
Type of document
Conference Publication
Language
en
Entity Type
Publication
Publisher
Association for the Advancement of Animal Breeding and Genetics
Place of publication
Armidale, Australia
UNE publication id
une:1959.11/71557
Abstract

Reliable pedigree and genomic data are essential for single-step genomic best linear unbiased prediction. Discrepancies between pedigree and genomic relationships must be identified and resolved before analysis. While parent-progeny relationships are typically verified using genomic data, other relationships, such as those between progeny and grandparents or half-sibs, are often unchecked. The numerator relationship matrix and genomic relationship matrix further obscure the precise nature of individuals' relationships. For example, half-sibs and grandparent-progeny pairs appear identical in the numerator relationship matrix. This article identifies these relationships among individuals in the numerator relationship matrix that are inconsistent with the genomic relationship matrix, applying graph theory to identify the precise type of their relationships and simplify pedigrees to pinpoint and correct errors. The results demonstrate that graph theory algorithms can accurately identify pedigree relationship types and extract any individual's ancestors, descendants, or other relationships from the pedigree.

Link
Citation
Proceedings of the AAABG 26th Conference, p. 303-306
ISSN
1328-3227
Start page
303
End page
306

Files:

NameSizeformatDescriptionLink