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

Finding noncommunicating sets for Markov chain Monte Carlo estimations on pedigrees.

American journal of human genetics - 1 Apr 1994

Lin S, Thompson E, Wijsman E

Abstract excerpt

Markov chain Monte Carlo (MCMC) has recently gained use as a method of estimating required probability and likelihood functions in pedigree analysis, when exact computation is impractical. However, when a multiallelic locus is involved, irreducibility of the constructed Markov chain, an essential requirement of the MCMC method, may fail. Solutions proposed by several researchers, which do not identify all the...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Alzheimer Disease
Share to Child

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

Share to Genotype

Share to Haplotypes

Share to Models, Genetic

Share to Monte Carlo Method

Share to Pedigree

Source

Open in PubMed Open full text

Identifiers

PMID: 8128968
PMCID: PMC1918109

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

Finding noncommunicating sets for Markov chain Monte Carlo estimations on pedigrees.PMID 8128968Read ↗

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

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

Generating consistent genotypic configurations for multi-allelic loci and large complex pedigrees.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 ↗

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

The cluster variation method for efficient linkage analysis on extended pedigrees.Semantic proximity Read ↗

Towards linkage analysis with markers in linkage disequilibrium by graphical modelling.Semantic proximity Read ↗

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

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

Ascertainment correction for Markov chain Monte Carlo segregation and linkage analysis of a quantitative trait.Semantic proximity Read ↗

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

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