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

The undirected incomplete perfect phylogeny problem.

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

Satya Ravi Vijaya, Mukherjee Amar

Abstract excerpt

The incomplete perfect phylogeny (IPP) problem and the incomplete perfect phylogeny haplotyping (IPPH) problem deal with constructing a phylogeny for a given set of haplotypes or genotypes with missing entries. The earlier approaches for both of these problems dealt with restricted versions of the problems, where the root is either available or can be trivially re-constructed from the data, or certain assumptions...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Biological Evolution
Share to Chromosome Mapping

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Evolution, Molecular

Share to Haplotypes

Share to Phylogeny

Share to Polymorphism, Single Nucleotide

Share to Sequence Analysis, DNA

Source

Identifiers

PMID: 18989047
DOI: 10.1109/TCBB.2007.70218

Genes

IPP

Provenance

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

Source receipt: pubmed, retrieved 6 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

The undirected incomplete perfect phylogeny problem.PMID 18989047Read ↗

The incomplete perfect phylogeny haplotype problem.Semantic proximity Read ↗

Constructing near-perfect phylogenies with multiple homoplasy events.Semantic proximity Read ↗

An efficient algorithm for Perfect Phylogeny Haplotyping.Semantic proximity Read ↗

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

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

A linear-time algorithm for the perfect phylogeny haplotyping (PPH) problem.Semantic proximity Read ↗

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

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

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

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

Algorithms for efficient near-perfect phylogenetic tree reconstruction in theory and practice.Semantic proximity Read ↗

Perfect phylogeny haplotyper: haplotype inferral using a tree model.Semantic proximity Read ↗

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