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

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

Genetics, selection, evolution : GSE - 3 Dec 2009

Totir Liviu R, Fernando Rohan L, Abraham Joseph

Abstract excerpt

BACKGROUND: Marginal posterior genotype probabilities need to be computed for genetic analyses such as geneticcounseling in humans and selective breeding in animal and plant species. METHODS: In this paper, we describe a peeling based, deterministic, exact algorithm to compute efficiently genotyp...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Cattle
Share to Cattle Diseases

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Computational Biology

Share to Computer Simulation

Share to Likelihood Functions

Share to Models, Genetic

Share to Probability

Source

Open in PubMed Open full text

Identifiers

PMID: 19958551
DOI: 10.1186/1297-9686-41-52
PMCID: PMC2801663

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 4 Sept 2026. Prepared record publication-19958551-2026-09-04.2. Manifest publication-graph-cohort-2026-09-04.2.

Source receipt: PubMed via Helena Literature Corpus, retrieved 4 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

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

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

Efficient computation of genotype probabilities for loci with many alleles: I. Allelic peeling.Semantic proximity Read ↗

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

Linear-time reconstruction of zero-recombinant Mendelian inheritance on pedigrees without mating loops.Semantic proximity Read ↗

Inferring haplotypes and parental genotypes in larger full sib-ships and other pedigrees with missing or erroneous genotype data.Semantic proximity Read ↗

Efficient computation of the joint probability of multiple inherited risk alleles from pedigree data.Semantic proximity Read ↗

Selecting loop breakers in general pedigrees.Semantic proximity Read ↗

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

Faster linkage analysis computations for pedigrees with loops or unused alleles.Semantic proximity Read ↗

Conditional probability methods for haplotyping in pedigrees.Semantic proximity Read ↗

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

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

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