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: I. Allelic peeling.

Journal of animal science - 1 Jan 2001

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

Abstract excerpt

Genetic marker data are likely to be obtained from a relatively small proportion of the individuals in many livestock populations. Information from genetic markers can be extrapolated to related individuals without marker data by computing genotype probabilities using an algorithm referred to as peeling. However, genetic markers may have many alleles and the number of computations in traditional peeling...

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 Delete account & data About Contact Helena Bioinformatics

Share to Breeding

Share to Genetic Markers

Share to Genotype

Share to Models, Genetic

Share to Pedigree

Source

Identifiers

PMID: 11204709
DOI: 10.2527/2001.79126x

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

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

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

Efficient computation of the joint probability of multiple inherited risk alleles from pedigree data.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 ↗

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

Evaluation of sequencing strategies for whole-genome imputation with hybrid peeling.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 ↗

The probabilistic determination of identity-by-descent sharing for pairs of relatives from pedigrees.Semantic proximity Read ↗

Faster linkage analysis computations for pedigrees with loops or unused alleles.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 ↗

Identity-by-descent estimation and mapping of qualitative traits in large, complex pedigrees.Semantic proximity Read ↗

Inexpensive Computation of the Inverse of the Genomic Relationship Matrix in Populations with Small Effective Population Size.Semantic proximity Read ↗

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