TAILIEUCHUNG - Báo cáo sinh học: " Irreducibility and efficiency of ESIP to sample marker genotypes in large pedigrees with loops"

Tuyển tập các báo cáo nghiên cứu về sinh học được đăng trên tạp chí sinh học thế giới đề tài: Irreducibility and efficiency of ESIP to sample marker genotypes in large pedigrees with loops | 537 Genet. Sel. Evol. 34 2002 537-555 INRA EDP Sciences 2002 DOI gse 2002022 Original article Irreducibility and efficiency of ESIP to sample marker genotypes in large pedigrees with loops Soledad A. FERNÁNDEZa Rohan L. Fernando0 Bernt GULDBRANDTSENd Christian STRiCKERe Matthias SCHELLiNGe Alicia L. Carriquiryc a Department of Statistics 317 Cockins Hall Ohio State University Columbus OH 43210 USA b Department of Animal Science 225 Kildee Hall Iowa State University Ames IA 50011 USA c Department of Statistics 219 Snedecor Hall Iowa State University Ames IA 50011 USA d Danish Institute of Animal Science Foulum Denmark e Institute of Animal Sciences Swiss Federal Institute of Technology ETH-Zentrum CLU 8092 Zurich Switzerland Received 21 August 2001 accepted 6 May 2002 Abstract - 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 the Markov chain that corresponds to scalar-Gibbs may not be irreducible when the marker locus has more than two alleles and even when the chain is irreducible mixing has been observed to be slow. Joint sampling of genotypes has been proposed as a strategy to overcome these problems. An algorithm that combines the Elston-Stewart algorithm and iterative peeling ESIP sampler to sample genotypes jointly from the entire pedigree is used in this study. Here it is shown that the ESIP sampler yields an irreducible Markov chain regardless of the number of alleles at a locus. Further results obtained by ESIP sampler are compared with other methods in the literature. Of the methods that are guaranteed to be irreducible ESIP was the most efficient. Metropolis-Hastings irreducibility Elston-Stewart algorithm iterative peeling Correspondence and reprints E-mail rohan@ 538 . Fernandez et al.

• Báo cáo khoa học
• Báo cáo sinh học hay
• cách trình bày báo cáo
• báo cáo sinh học
• công trình nghiên cứu sinh học
• tài liệu về sinh học