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 improved heuristic for haplotype inference.

Gene - 10 Oct 2012

Ramadhani Samira, Mousavi Sayyed R, Talebi Majid

Abstract excerpt

Haplotypes include essential SNP information used for a variety of purposes such as investigating potential links between certain diseases and genetic variations. Given a set of genotypes, the haplotype inference problem based on pure parsimony is the problem of finding a minimum set of haplotypes that explains all the given genotypes. The problem is especially important because, while it is fairly inexpensive to...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Computer Simulation
Share to Haplotypes

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

Share to Models, Genetic

Share to Polymorphism, Single Nucleotide

Source

Identifiers

PMID: 22776766
DOI: 10.1016/j.gene.2012.06.032

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

An improved heuristic for haplotype inference.PMID 22776766Read ↗

An improved preprocessing algorithm for haplotype inference by pure parsimony.Semantic proximity Read ↗

Haplotype inference by Pure Parsimony: a survey.Semantic proximity Read ↗

A highly accurate heuristic algorithm for the haplotype assembly problem.Semantic proximity Read ↗

Haplotype inference constrained by plausible haplotype data.Semantic proximity Read ↗

Haplotype inference by maximum parsimony.Semantic proximity Read ↗

A fast and accurate algorithm for diploid individual haplotype reconstruction.Semantic proximity Read ↗

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

Highly scalable genotype phasing by entropy minimization.Semantic proximity Read ↗

Using genetic algorithm in reconstructing single individual haplotype with minimum error correction.Semantic proximity Read ↗

Pure parsimony xor haplotyping.Semantic proximity Read ↗

Haplotype Inference.Semantic proximity Read ↗

Highly scalable genotype phasing by entropy minimization.Semantic proximity Read ↗

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