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

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

Biometrics - 1 Jun 1998

Jensen C S, Sheehan N

Abstract excerpt

Exact calculations for probabilities on complex pedigrees are computationally intensive and very often infeasible. Markov chain Monte Carlo methods are frequently used to approximate probabilities and likelihoods of interest. However, when a locus with more than two alleles is considered, the underlying Markov chain is not guaranteed to be irreducible and the results of such analyses are unreliable. A method for...

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 Genotype

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

Share to Markov Chains

Share to Models, Genetic

Share to Models, Statistical

Share to Monte Carlo Method

Share to Pedigree

Source

Identifiers

PMID: 9629636

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

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

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

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

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

Detection and integration of genotyping errors in statistical genetics.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 ↗

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

Sampling genotype configurations in a large complex pedigree.Semantic proximity Read ↗

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

An efficient algorithm to compute marginal posterior genotype probabilities for every member of a pedigree with loops.Semantic proximity Read ↗

Improved computations for relationship inference using low-coverage sequencing data.Semantic proximity Read ↗

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

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