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

Haplotyping for disease association: a combinatorial approach.

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

Lancia Giuseppe, Ravi R, Rizzi Romeo

Abstract excerpt

We consider a combinatorial problem derived from haplotyping a population with respect to a genetic disease, either recessive or dominant. Given a set of individuals, partitioned into healthy and diseased, and the corresponding sets of genotypes, we want to infer "bad'' and "good'' haplotypes to account for these genotypes and for the disease. Assume e.g. the disease is recessive. Then, the resolving haplotypes...

Read the complete abstract on PubMed

Topics

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

Share to Computational Biology
Share to Genetic Diseases, Inborn
Share to Genetic Predisposition to Disease

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Genotype

Share to Haplotypes

Share to Mathematics

Share to Models, Genetic

Share to Polymorphism, Single Nucleotide

Source

Identifiers

PMID: 18451433
DOI: 10.1109/TCBB.2007.70255

Provenance

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

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Haplotyping for disease association: a combinatorial approach.PMID 18451433Read ↗

Pure parsimony xor haplotyping.Semantic proximity Read ↗

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

Haplotype inferring via galled-tree networks is NP-complete.Semantic proximity Read ↗

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

An improved preprocessing algorithm for haplotype inference by pure parsimony.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 ↗

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

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

Islands of tractability for parsimony haplotyping.Semantic proximity Read ↗

Islands of tractability for parsimony haplotyping.Semantic proximity Read ↗

Tractable Cases of (*,2)-Bounded Parsimony Haplotyping.Semantic proximity Read ↗

An exact test for the association between the disease and alleles at highly polymorphic loci with particular interest in the haplotype analysis.Semantic proximity Read ↗

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