Cargando…
Irreducibility and efficiency of ESIP to sample marker genotypes in large pedigrees with loops
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, and it is used in genetics. However...
Autores principales: | Fernández, Soledad A, Fernando, Rohan L, Guldbrandtsen, Bernt, Stricker, Christian, Schelling, Matthias, Carriquiry, Alicia L |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2002
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2705433/ https://www.ncbi.nlm.nih.gov/pubmed/12427385 http://dx.doi.org/10.1186/1297-9686-34-5-537 |
Ejemplares similares
-
Sampling genotypes in large pedigrees with loops
por: Fernández, Soledad A, et al.
Publicado: (2001) -
Estimation of inbreeding using pedigree, 50k SNP chip genotypes and full sequence data in three cattle breeds
por: Zhang, Qianqian, et al.
Publicado: (2015) -
A comparison of alternative methods to compute conditional genotype probabilities for genetic evaluation with finite locus models
por: Totir, Liviu R, et al.
Publicado: (2003) -
An efficient algorithm to compute marginal posterior genotype probabilities for every member of a pedigree with loops
por: Totir, Liviu R, et al.
Publicado: (2009) -
The effect of using approximate gametic variance covariance matrices on marker assisted selection by BLUP
por: Totir, Liviu R, et al.
Publicado: (2004)