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

Irreducibility and efficiency of ESIP to sample marker genotypes in large pedigrees with loops.

Genetics, selection, evolution : GSE - 1 Jan 2000

Fernández Soledad A, Fernando Rohan L, Guldbrandtsen Bernt, Stricker Christian, Schelling Matthias, Carriquiry Alicia L

Abstract excerpt

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...

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

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

Share to Genotype

Share to Markov Chains

Share to Models, Genetic

Share to Monte Carlo Method

Share to Pedigree

Share to Quantitative Trait Loci

Source

Open in PubMed Open full text

Identifiers

PMID: 12427385
DOI: 10.1186/1297-9686-34-5-537
PMCID: PMC2705433

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

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

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

A comparison of alternative methods to compute conditional genotype probabilities for genetic evaluation with finite locus models.Semantic proximity Read ↗

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

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

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

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

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

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

A sampling algorithm for segregation analysis.Semantic proximity Read ↗

Bayesian oligogenic analysis of quantitative and qualitative traits in general pedigrees.Semantic proximity Read ↗

An optimal algorithm for automatic genotype elimination.Semantic proximity Read ↗

Efficient computation of genotype probabilities for loci with many alleles: II. Iterative method for large, complex pedigrees.Semantic proximity Read ↗

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