Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2016 Sep 20;48(1):70.
doi: 10.1186/s12711-016-0249-2.

A fast Newton-Raphson based iterative algorithm for large scale optimal contribution selection

Affiliations

A fast Newton-Raphson based iterative algorithm for large scale optimal contribution selection

Binyam S Dagnachew et al. Genet Sel Evol. .

Abstract

Background: The management of genetic variation in a breeding scheme relies very much on the control of the average relationship between selected parents. Optimum contribution selection is a method that seeks the optimum way to select for genetic improvement while controlling the rate of inbreeding.

Methods: A novel iterative algorithm, Gencont2, for calculating optimum genetic contributions was developed. It was validated by comparing it with a previous program, Gencont, on three datasets that were obtained from practical breeding programs in three species (cattle, pig and sheep). The number of selection candidates was 2929, 3907 and 6875 for the pig, cattle and sheep datasets, respectively.

Results: In most cases, both algorithms selected the same candidates and led to very similar results with respect to genetic gain for the cattle and pig datasets. In cases, where the number of animals to select varied, the contributions of the additional selected candidates ranged from 0.006 to 0.08 %. The correlations between assigned contributions were very close to 1 in all cases; however, the iterative algorithm decreased the computation time considerably by 90 to 93 % (13 to 22 times faster) compared to Gencont. For the sheep dataset, only results from the iterative algorithm are reported because Gencont could not handle a large number of selection candidates.

Conclusions: Thus, the new iterative algorithm provides an interesting alternative for the practical implementation of optimal contribution selection on a large scale in order to manage inbreeding and increase the sustainability of animal breeding programs.

PubMed Disclaimer

Figures

Fig. 1
Fig. 1
Association between EBV and optimized genetic contribution for the selected candidates in the cattle dataset by applying two levels of constraints on rate of inbreeding (ΔF)). ΔG = genetic gain
Fig. 2
Fig. 2
Pedigree structure for the example data. The values in brackets are estimated breeding values and the relationships were calculated based on the pedigree (from Pong-Wong and Woolliams [7])

Similar articles

Cited by

References

    1. Quinton M, Smith C, Goddard ME. Comparison of selection methods at the same level of inbreeding. J Anim Sci. 1992;70:1060–1067. doi: 10.2527/1992.7041060x. - DOI - PubMed
    1. Burrow HM. The effects of inbreeding in beef cattle. Anim Breed Abstr. 1993;61:737–751.
    1. Falconer DS. Introduction to quantitative genetics. 3. Harlow: Longman Scientifics & Technical; 1989.
    1. Lamberson WR, Thomas DL. Effects of inbreeding in sheep. A review. Anim Breed Abstr. 1984;52:287–297.
    1. Grundy B, Villanueva B, Woolliams JA. Dynamic selection procedures for constrained inbreeding and their consequences for pedigree development. Genet Res. 1998;72:159–168. doi: 10.1017/S0016672398003474. - DOI

LinkOut - more resources