Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

Achieving irreducibility of the Markov chain Monte Carlo method applied to pedigree data.

IMA journal of mathematics applied in medicine and biology - 1 Jan 1993

Lin S, Thompson E, Wijsman E

Abstract excerpt

Markov chain Monte Carlo (MCMC) methods have been explored by various researchers as an alternative to exact probability computation in statistical genetics. The objective is to simulate a Markov chain with the desired equilibrium distribution. If the transition kernel is aperiodic and irreducible, then convergence to the equilibrium distribution is guaranteed; realizations of the Markov chain can thus be used to...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Alleles
Share to Analysis of Variance

Methodology Data sources Editorial policy Privacy Delete account & data About Contact Helena Bioinformatics

Share to Genotype

Share to Likelihood Functions

Share to Monte Carlo Method

Share to Pedigree

Share to Probability

Source

Identifiers

PMID: 8409623
DOI: 10.1093/imammb/10.1.1

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 7 Sept 2026. Manifest publication-graph-cohort-2026-09-08.1.

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence. Graph snapshot: 2026-09-29.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Achieving irreducibility of the Markov chain Monte Carlo method applied to pedigree data.PMID 8409623Read ↗

Finding noncommunicating sets for Markov chain Monte Carlo estimations on pedigrees.Semantic proximity Read ↗

On the irreducibility of a Markov chain defined on a space of genotype configurations by a sampling scheme.Semantic proximity Read ↗

A scheme for constructing an irreducible Markov chain for pedigree data.Semantic proximity Read ↗

Irreducibility and efficiency of ESIP to sample marker genotypes in large pedigrees with loops.Semantic proximity Read ↗

Problems with determination of noncommunicating classes for Monte Carlo Markov chain applications in pedigree analysis.Semantic proximity Read ↗

Sampling genotypes in large pedigrees with loops.Semantic proximity Read ↗

Generating consistent genotypic configurations for multi-allelic loci and large complex pedigrees.Semantic proximity Read ↗

Markov chain Monte Carlo segregation and linkage analysis for oligogenic models.Semantic proximity Read ↗

An algorithm for Monte Carlo estimation of genotype probabilities on complex pedigrees.Semantic proximity Read ↗

Blocking Gibbs sampling for linkage analysis in large pedigrees with many loops.Semantic proximity Read ↗

A Markov chain Monte Carlo strategy for sampling from the joint posterior distribution of pedigrees and population parameters under a Fisher-Wright model with partial selfing.Semantic proximity Read ↗

Accuracy, efficiency and robustness of four algorithms allowing full sibship reconstruction from DNA marker data.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.