Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/21381
Title: On marker-based parentage verification via non-linear optimization
Contributor(s): Boerner, Vinzent  (author)
Publication Date: 2017
Open Access: Yes
DOI: 10.1186/s12711-017-0324-3Open Access Link
Handle Link: https://hdl.handle.net/1959.11/21381
Abstract: Background: Parentage verification by molecular markers is mainly based on short tandem repeat markers. Single nucleotide polymorphisms (SNPs) as bi-allelic markers have become the markers of choice for genotyping projects. Thus, the subsequent step is to use SNP genotypes for parentage verification as well. Recent developments of algorithms such as evaluating opposing homozygous SNP genotypes have drawbacks, for example the inability of rejecting all animals of a sample of potential parents. This paper describes an algorithm for parentage verification by constrained regression which overcomes the latter limitation and proves to be very fast and accurate even when the number of SNPs is as low as 50. The algorithm was tested on a sample of 14,816 animals with 50, 100 and 500 SNP genotypes randomly selected from 40k genotypes. The samples of putative parents of these animals contained either five random animals, or four random animals and the true sire. Parentage assignment was performed by ranking of regression coefficients, or by setting a minimum threshold for regression coefficients. The assignment quality was evaluated by the power of assignment (Pa) and the power of exclusion (Pe). Results: If the sample of putative parents contained the true sire and parentage was assigned by coefficient ranking, Pa and Pe were both higher than 0.99 for the 500 and 100 SNP genotypes, and higher than 0.98 for the 50 SNP genotypes. When parentage was assigned by a coefficient threshold, Pe was higher than 0.99 regardless of the number of SNPs, but Pa decreased from 0.99 (500 SNPs) to 0.97 (100 SNPs) and 0.92 (50 SNPs). If the sample of putative parents did not contain the true sire and parentage was rejected using a coefficient threshold, the algorithm achieved a Pe of 1 (500 SNPs), 0.99 (100 SNPs) and 0.97 (50 SNPs). Conclusion: The algorithm described here is easy to implement, fast and accurate, and is able to assign parentage using genomic marker data with a size as low as 50 SNPs.
Publication Type: Journal Article
Source of Publication: Genetics Selection Evolution, v.49, p. 1-7
Publisher: BioMed Central Ltd
Place of Publication: United Kingdom
ISSN: 1297-9686
0999-193X
Fields of Research (FoR) 2008: 070201 Animal Breeding
060412 Quantitative Genetics (incl. Disease and Trait Mapping Genetics)
060411 Population, Ecological and Evolutionary Genetics
Fields of Research (FoR) 2020: 300305 Animal reproduction and breeding
310506 Gene mapping
Socio-Economic Objective (SEO) 2008: 970108 Expanding Knowledge in the Information and Computing Sciences
830301 Beef Cattle
970107 Expanding Knowledge in the Agricultural and Veterinary Sciences
Socio-Economic Objective (SEO) 2020: 280115 Expanding knowledge in the information and computing sciences
100401 Beef cattle
280101 Expanding knowledge in the agricultural, food and veterinary sciences
Peer Reviewed: Yes
HERDC Category Description: C1 Refereed Article in a Scholarly Journal
Appears in Collections:Animal Genetics and Breeding Unit (AGBU)
Journal Article

Files in This Item:
2 files
File Description SizeFormat 
Show full item record

SCOPUSTM   
Citations

3
checked on Nov 23, 2024

Page view(s)

2,364
checked on Nov 24, 2024
Google Media

Google ScholarTM

Check

Altmetric


Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.