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 for haplotype inference on pedigrees with recombinations and mutations.

IEEE/ACM transactions on computational biology and bioinformatics - 1 Jan 2000

Pirola Yuri, Bonizzoni Paola, Jiang Tao

Abstract excerpt

Haplotype Inference (HI) is a computational challenge of crucial importance in a range of genetic studies. Pedigrees allow to infer haplotypes from genotypes more accurately than population data, since Mendelian inheritance restricts the set of possible solutions. In this work, we define a new HI problem on pedigrees, called MINIMUM-CHANGE HAPLOTYPE CONFIGURATION (MCHC) problem, that allows two types of genetic...

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 Haplotypes

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Models, Genetic

Share to Mutation

Share to Pedigree

Share to Recombination, Genetic

Source

Identifiers

PMID: 21383417
DOI: 10.1109/TCBB.2011.51

Provenance

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

Source receipt: pubmed, retrieved 5 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

An efficient algorithm for haplotype inference on pedigrees with recombinations and mutations.PMID 21383417Read ↗

A fast and practical approach to genotype phasing and imputation on a pedigree with erroneous and incomplete information.Semantic proximity Read ↗

Efficient inference of haplotypes from genotypes on a pedigree.Semantic proximity Read ↗

Computing the minimum recombinant haplotype configuration from incomplete genotype data on a pedigree by integer linear programming.Semantic proximity Read ↗

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

Inferring haplotypes from genotypes on a pedigree with mutations, genotyping errors and missing alleles.Semantic proximity Read ↗

An almost linear time algorithm for a general haplotype solution on tree pedigrees with no recombination and its extensions.Semantic proximity Read ↗

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

Minimum-recombinant haplotyping in pedigrees.Semantic proximity Read ↗

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

Estimate haplotype frequencies in pedigrees.Semantic proximity Read ↗

Constructing founder sets under allelic and non-allelic homologous recombinationSemantic proximity Read ↗

Efficient computation of minimum recombination with genotypes (not haplotypes).Semantic proximity Read ↗

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