Irreducibility and efficiency of ESIP to sample marker genotypes in large pedigrees with loops

Irreducibility and efficiency of ESIP to sample marker genotypes in large pedigrees with loops

<p>Abstract</p> <p>Markov chain Monte Carlo (MCMC) methods have been proposed to overcome computational problems in linkage and segregation analyses. This approach involves sampling genotypes at the marker and trait loci. Among MCMC methods, scalar-Gibbs is the easiest to implement...

Full description

Bibliographic Details
Main Authors: Schelling Matthias, Stricker Christian, Guldbrandtsen Bernt, Fernando Rohan L, Fernández Soledad A, Carriquiry Alicia L
Format: Article
Language:deu
Published: BMC 2002-09-01
Series:Genetics Selection Evolution
Subjects:
Metropolis-Hastings
irreducibility
Elston-Stewart algorithm
iterative peeling
Online Access:http://www.gsejournal.org/content/34/5/537

Similar Items

Similar Items