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

Haplotype inferring via galled-tree networks is NP-complete.

Journal of computational biology : a journal of computational molecular cell biology - 1 Oct 2010

Gupta Arvind, Karimi Mohammad M, Manuch Ján, Stacho Ladislav, Zhao Xiaohong

Abstract excerpt

The problem of determining haplotypes from genotypes has gained considerable prominence in the research community since the beginning of the HapMap project. Here the focus is on determining the sets of SNP values of individual chromosomes (haplotypes), since such information better captures the genetic causes of diseases. One of the main algorithmic tools for haplotyping is based on the assumption that the...

Read the complete abstract on PubMed

Topics

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

Share to Biological Evolution
Share to Genotype

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

Share to Algorithms

Share to Haplotypes

Share to Models, Genetic

Share to Phylogeny

Share to Polymorphism, Single Nucleotide

Source

Identifiers

PMID: 20937016
DOI: 10.1089/cmb.2009.0117

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

Haplotype inferring via galled-tree networks is NP-complete.PMID 20937016Read ↗

Algorithm for haplotype inference via galled-tree networks with simple galls.Semantic proximity Read ↗

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

Efficient reconstruction of haplotype structure via perfect phylogeny.Semantic proximity Read ↗

Parameterised algorithms of the individual haplotyping problem with gaps.Semantic proximity Read ↗

Optimal imperfect phylogeny reconstruction and haplotyping (IPPH).Semantic proximity Read ↗

A model of higher accuracy for the individual haplotyping problem based on weighted SNP fragments and genotype with errors.Semantic proximity Read ↗

Haplotype reconstruction from genotype data using Imperfect Phylogeny.Semantic proximity Read ↗

A survey on haplotyping algorithms for tightly linked markers.Semantic proximity Read ↗

Haplotyping as perfect phylogeny: a direct approach.Semantic proximity Read ↗

The incomplete perfect phylogeny haplotype problem.Semantic proximity Read ↗

RadixHap: a radix tree-based heuristic for solving the single individual haplotyping problem.Semantic proximity Read ↗

Haplotyping in pedigrees via a genetic algorithm.Semantic proximity Read ↗

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