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 efficient algorithm for Perfect Phylogeny Haplotyping.

Proceedings. IEEE Computational Systems Bioinformatics Conference - 1 Jan 2005

Vijayasatya Ravi, Mukherjee Amar

Abstract excerpt

The Perfect Phylogeny Haplotyping (PPH) problem is one of the many computational approaches to the Haplotype Inference (HI) problem. Though there are many O(nm(2)) solutions to the PPH problem, the complexity of the PPH problem itself has remained an open question. In this paper, We introduce the FlexTree data structure that represents all the solutions for a PPH instance. We also introduce row-ordering that...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Base Sequence
Share to Chromosome Mapping

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

Share to Haplotypes

Share to Molecular Sequence Data

Share to Phylogeny

Share to Sequence Alignment

Share to Sequence Analysis, DNA

Source

Identifiers

PMID: 16447968
DOI: 10.1109/csb.2005.12

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 efficient algorithm for Perfect Phylogeny Haplotyping.PMID 16447968Read ↗

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

The incomplete perfect phylogeny haplotype problem.Semantic proximity Read ↗

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

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

The undirected incomplete perfect phylogeny problem.Semantic proximity Read ↗

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

Haplotype inference constrained by plausible haplotype data.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 ↗

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

Haplotype reconstruction using perfect phylogeny and sequence data.Semantic proximity Read ↗

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

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