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. Scalar-Gibbs is easy to implement, and it is widely 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. These problems do not arise if the genotypes are sampled jointly from the entire pedigree. This paper proposes a method to jointly sample genotypes. The method combines the Elston-Stewart algorithm and iterative peeling, and is called the ESIP sampler. For a hypothetical pedigree, genotype probabilities are estimated from samples obtained using ESIP and also scalar-Gibbs. Approximate probabilities were also obtained by iterative peeling. Comparisons of these with exact genotypic probabilities obtained by the Elston-Stewart algorithm showed that ESIP and iterative peeling yielded genotypic probabilities that were very close to the exact values. Nevertheless, estimated probabilities from scalar-Gibbs with a chain of length 235 000, including a burn-in of 200 000 steps, were less accurate than probabilities estimated using ESIP with a chain of length 10 000, with a burn-in of 5 000 steps. The effective chain size (ECS) was estimated from the last 25 000 elements of the chain of length 125 000. For one of the ESIP samplers, the ECS ranged from 21 579 to 22 741, while for the scalar-Gibbs sampler, the ECS ranged from 64 to 671. Genotype probabilities were also estimated for a large real pedigree consisting of 3 223 individuals. For this pedigree, it is not feasible to obtain exact genotype probabilities by the Elston-Stewart algorithm. ESIP and iterative peeling yielded very similar results. However, results from scalar-Gibbs were less accurate.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2705411 | PMC |
http://dx.doi.org/10.1186/1297-9686-33-4-337 | DOI Listing |
Allergol Select
October 2024
Center for Child and Adolescent Health, Helios Hospital Krefeld, Academic Hospital of RWTH Aachen, Krefeld.
Proc Natl Acad Sci U S A
August 2024
Department of Applied Science and Technology, Politecnico di Torino, Torino 10129, Italy.
Complex systems are typically characterized by intricate internal dynamics that are often hard to elucidate. Ideally, this requires methods that allow to detect and classify in an unsupervised way the microscopic dynamical events occurring in the system. However, decoupling statistically relevant fluctuations from the internal noise remains most often nontrivial.
View Article and Find Full Text PDFEntropy (Basel)
July 2023
School of Communication and Information Engineering, Xi'an University of Science and Technology, Xi'an 710054, China.
Spatially coupled low density parity check (SC-LDPC) are prominent candidates for future communication standards due to their "threshold saturation" properties. To evaluate the finite-length performance of SC-LDPC codes, a general and efficient finite-length analysis from the perspective of the base matrix is proposed. We analyze the evolution of the residual graphs resulting at each iteration during the decoding process based on the base matrix and then derive the expression for the error probability.
View Article and Find Full Text PDFAnal Methods
August 2023
College of Agricultural Engineering and Food Science, Shandong University of Technology, Zibo 255000, China.
The quantitative determination of the soluble solid content (SSC) of potatoes using NIR spectroscopy is useful for predicting the internal and external quality of potato products, especially fried products. In this study, the effect of peel on the partial least squares regression (PLSR) quantitative prediction of potato SSC was investigated by transmission and reflection. The results show that the variable sorting for normalization (VSN) pre-processing method improved model accuracy.
View Article and Find Full Text PDFFront Neurosci
August 2022
Department of Computer Science, School of Computing and Engineering, University of Huddersfield, Huddersfield, United Kingdom.
Dementia is an incurable neurodegenerative disease primarily affecting the older population, for which the World Health Organisation has set to promoting early diagnosis and timely management as one of the primary goals for dementia care. While a range of popular machine learning algorithms and their variants have been applied for dementia diagnosis, fuzzy systems, which have been known effective in dealing with uncertainty and offer to explicitly reason how a diagnosis can be inferred, sporadically appear in recent literature. Given the advantages of a fuzzy rule-based model, which could potentially result in a clinical decision support system that offers understandable rules and a transparent inference process to support dementia diagnosis, this paper proposes a novel fuzzy inference system by adapting the concept of dominant sets that arise from the study of graph theory.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!