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

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

Journal of animal science - 1 Jan 2001

Thallman R M, Bennett G L, Keele J W, Kappes S M

Abstract excerpt

An algorithm for computing genotype probabilities for marker loci with many alleles in large, complex pedigrees with missing marker data is presented. The algorithm can also be used to calculate grandparental origin probabilities, which summarize the segregation pattern and are useful for mapping quantitative trait loci. The algorithm is iterative and is based on peeling on alleles instead of the traditional...

Read the complete abstract on PubMed

Topics

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

Share to Alleles
Share to Animal Husbandry
Share to Animals, Domestic

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Breeding

Share to Genetic Markers

Share to Genotype

Share to Models, Genetic

Share to Pedigree

Source

Identifiers

PMID: 11204712
DOI: 10.2527/2001.79134x

Provenance

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

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

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

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

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

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

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

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

Imputation of missing genotypes from sparse to high density using long-range phasing.Semantic proximity Read ↗

Optimal peeling order for pedigrees with incomplete genotypic information.Semantic proximity Read ↗

The use of family relationships and linkage disequilibrium to impute phase and missing genotypes in up to whole-genome sequence density genotypic data.Semantic proximity Read ↗

Coordinated conditional simulation with SLINK and SUP of many markers linked or associated to a trait in large pedigrees.Semantic proximity Read ↗

Accounting for linkage in family-based tests of association with missing parental genotypes.Semantic proximity Read ↗

Using genomic relationship likelihood for parentage assignment.Semantic proximity Read ↗

Modeling of identity-by-descent processes along a chromosome between haplotypes and their genotyped ancestors.Semantic proximity Read ↗

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