On the Metropolis-Hastings Acceptance Probability to Add or Drop a Quantitative Trait Locus in Markov Chain Monte Carlo-Based Bayesian Analyses
Open Access
- 1 January 2004
- journal article
- Published by Oxford University Press (OUP) in Genetics
- Vol. 166 (1) , 641-643
- https://doi.org/10.1534/genetics.166.1.641
Abstract
The Metropolis-Hastings algorithm used in analyses that estimate the number of QTL segregating in a mapping population requires the calculation of an acceptance probability to add or drop a QTL from the model. Expressions for this acceptance probability need to recognize that sets of QTL are unordered such that the number of equivalent sets increases with the factorial of the QTL number. Here, we show how accounting for this fact affects the acceptance probability and review expressions found in the literature.Keywords
This publication has 7 references indexed in Scilit:
- On flexible finite polygenic models for multiple-trait evaluationGenetics Research, 2002
- Likelihood, Bayesian, and MCMC Methods in Quantitative GeneticsPublished by Springer Nature ,2002
- Performance of Markov Chain–Monte Carlo Approaches for Mapping Genes in Oligogenic Models with an Unknown Number of LociAmerican Journal of Human Genetics, 2000
- Bayesian Analysis of Quantitative Trait Locus Data Using Reversible Jump Markov Chain Monte CarloPublished by JSTOR ,1998
- Bayesian Mapping of Multiple Quantitative Trait Loci From Incomplete Inbred Line Cross DataGenetics, 1998
- Markov Chain Monte Carlo Segregation and Linkage Analysis for Oligogenic ModelsAmerican Journal of Human Genetics, 1997
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determinationBiometrika, 1995