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

Tractable Cases of (*,2)-Bounded Parsimony Haplotyping.

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

Keijsper Judith, Oosterwijk Tim

Abstract excerpt

Parsimony haplotyping is the problem of finding a set of haplotypes of minimum cardinality that explains a given set of genotypes, where a genotype is explained by two haplotypes if it can be obtained as a combination of the two. This problem is NP-complete in the general case, but polynomially solvable for (k, l)-bounded instances for certain k and l. Here, k denotes the maximum number of ambiguous sites in any...

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 Drug Discovery

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

Share to Genetic Predisposition to Disease

Share to Haplotypes

Share to Models, Genetic

Source

Identifiers

PMID: 26357092
DOI: 10.1109/TCBB.2014.2352031

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

Tractable Cases of (*,2)-Bounded Parsimony Haplotyping.PMID 26357092Read ↗

Pure parsimony xor haplotyping.Semantic proximity Read ↗

Islands of tractability for parsimony haplotyping.Semantic proximity Read ↗

Islands of tractability for parsimony haplotyping.Semantic proximity Read ↗

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

Shorelines of islands of tractability: algorithms for parsimony and minimum perfect phylogeny haplotyping problems.Semantic proximity Read ↗

Computational problems in perfect phylogeny haplotyping: typing without calling the allele.Semantic proximity Read ↗

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

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

Toward an algebraic understanding of haplotype inference by pure parsimony.Semantic proximity Read ↗

A note on efficient computation of haplotypes via perfect phylogeny.Semantic proximity Read ↗

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

Integer programming approaches to haplotype inference by pure parsimony.Semantic proximity Read ↗

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