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

Optimal peeling order for pedigrees with incomplete genotypic information.

Computational biology and chemistry - 1 Jun 2007

Belonogova Nadezhda M, Axenovich Tatiana I

Abstract excerpt

The likelihood approach is common in linkage analysis of large extended pedigrees. Various peeling procedures, based on the conditional independence of separate parts of a pedigree, are typically used for likelihood calculations. A peeling order may significantly affect the complexity of such calculations, particularly for pedigrees with loops or when many pedigrees members have unknown genotypes. Several...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Computational Biology
Share to Foxes

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

Share to Genetic Linkage

Share to Internet

Share to Likelihood Functions

Share to Quantitative Trait, Heritable

Share to Software

Source

Identifiers

PMID: 17500037
DOI: 10.1016/j.compbiolchem.2007.03.004

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

Optimal peeling order for pedigrees with incomplete genotypic information.PMID 17500037Read ↗

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 ↗

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

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

Selecting loop breakers in general pedigrees.Semantic proximity Read ↗

A hierarchical model for estimating significance levels of non-parametric linkage statistics for large pedigrees.Semantic proximity Read ↗

Technical note: determining peeling order using sparse matrix algorithms.Semantic proximity Read ↗

A multilocus likelihood approach to joint modeling of linkage, parental diplotype and gene order in a full-sib family.Semantic proximity Read ↗

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

A note on algorithms for genotype and allele elimination in complex pedigrees with incomplete genotype data.Semantic proximity Read ↗

A novel algorithm for minimum recombinant haplotyping on pedigrees by zero recombinant block partition.Semantic proximity Read ↗

A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on a pedigree.Semantic proximity Read ↗

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