A comparison of alternative methods to compute conditional genotype probabilities for genetic evaluation with finite locus models
Autor: | Rohan L. Fernando, Soledad Fernandez, Jack C. M. Dekkers, Liviu R. Totir, Bernt Guldbrandtsen |
---|---|
Jazyk: | angličtina |
Rok vydání: | 2003 |
Předmět: |
lcsh:QH426-470
Genotype Monte Carlo method Locus (genetics) Best linear unbiased prediction Biology Conditional expectation symbols.namesake Statistics Genetics Quantitative Biology::Populations and Evolution Genetics(clinical) Ecology Evolution Behavior and Systematics lcsh:SF1-1100 Probability genotype probabilities Models Genetic Research Markov chain Monte Carlo General Medicine Marker-assisted selection Heritability Quantitative Biology::Genomics finite locus models lcsh:Genetics symbols Animal Science and Zoology lcsh:Animal culture Gibbs sampling |
Zdroj: | Genetics, Selection, Evolution : GSE Totir, L R, Fernando, R L, Dekkers, J C M, Fernandez, S A & Guldbrandtsen, B 2003, ' A comparison of alternative methods to compute conditional genotype probabilities for genetic evaluation with finite locus models ', Genetics Selection Evolution, vol. 35, 585, pp. 585-604 . https://doi.org/10.1051/gse:2003041 Genetics Selection Evolution, Vol 35, Iss 7, Pp 585-604 (2003) |
ISSN: | 1297-9686 0999-193X |
DOI: | 10.1051/gse:2003041 |
Popis: | An increased availability of genotypes at marker loci has prompted the development of models that include the effect of individual genes. Selection based on these models is known as marker-assisted selection (MAS). MAS is known to be efficient especially for traits that have low heritability and non-additive gene action. BLUP methodology under non-additive gene action is not feasible for large inbred or crossbred pedigrees. It is easy to incorporate non-additive gene action in a finite locus model. Under such a model, the unobservable genotypic values can be predicted using the conditional mean of the genotypic values given the data. To compute this conditional mean, conditional genotype probabilities must be computed. In this study these probabilities were computed using iterative peeling, and three Markov chain Monte Carlo (MCMC) methods – scalar Gibbs, blocking Gibbs, and a sampler that combines the Elston Stewart algorithm with iterative peeling (ESIP). The performance of these four methods was assessed using simulated data. For pedigrees with loops, iterative peeling fails to provide accurate genotype probability estimates for some pedigree members. Also, computing time is exponentially related to the number of loci in the model. For MCMC methods, a linear relationship can be maintained by sampling genotypes one locus at a time. Out of the three MCMC methods considered, ESIP, performed the best while scalar Gibbs performed the worst. |
Databáze: | OpenAIRE |
Externí odkaz: |