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

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

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

Pirola Yuri, Della Vedova Gianluca, Biffani Stefano, Stella Alessandra, Bonizzoni Paola

Abstract excerpt

The MINIMUM-RECOMBINANT HAPLOTYPE CONFIGURATION problem (MRHC) has been highly successful in providing a sound combinatorial formulation for the important problem of genotype phasing on pedigrees. Despite several algorithmic advances that have improved the efficiency, its applicability to real da...

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 Computational Biology

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Genotype

Share to Haplotypes

Share to Models, Genetic

Share to Pedigree

Share to Recombination, Genetic

Source

Identifiers

PMID: 22848137
DOI: 10.1109/TCBB.2012.100

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 4 Sept 2026. Prepared record publication-22848137-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

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

An efficient algorithm for haplotype inference on pedigrees with recombinations and mutations.Semantic proximity Read ↗

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

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

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

Family trio phasing and missing data recovery.Semantic proximity Read ↗

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

Extending long-range phasing and haplotype library imputation algorithms to large and heterogeneous datasets.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 ↗

Efficient genotype elimination via adaptive allele consolidation.Semantic proximity Read ↗

Haplotype reconstruction from SNP fragments by minimum error correction.Semantic proximity Read ↗

GERBIL: Genotype resolution and block identification using likelihood.Semantic proximity Read ↗

2SNP: scalable phasing method for trios and unrelated individuals.Semantic proximity Read ↗

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