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

A parsimonious tree-grow method for haplotype inference.

Bioinformatics (Oxford, England) - 1 Sept 2005

Li Zhenping, Zhou Wenfeng, Zhang Xiang-Sun, Chen Luonan

Abstract excerpt

MOTIVATION: Haplotype information has become increasingly important in analyzing fine-scale molecular genetics data, such as disease genes mapping and drug design. Parsimony haplotyping is one of haplotyping problems belonging to NP-hard class. RESULTS: In this paper, we aim to develop a novel algorithm for the haplotype inference problem with the parsimony criterion, based on a parsimonious tree-grow method...

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 About Contact Helena Bioinformatics

Share to Haplotypes

Share to Models, Genetic

Share to Sequence Alignment

Share to Sequence Analysis, DNA

Share to Software

Source

Identifiers

PMID: 16002432
DOI: 10.1093/bioinformatics/bti572

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

A parsimonious tree-grow method for haplotype inference.PMID 16002432Read ↗

A better block partition and ligation strategy for individual haplotyping.Semantic proximity Read ↗

Haplotype inference by maximum parsimony.Semantic proximity Read ↗

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

An improved preprocessing algorithm for haplotype inference by pure parsimony.Semantic proximity Read ↗

A fast and accurate algorithm for diploid individual haplotype reconstruction.Semantic proximity Read ↗

A statistical framework for haplotype block inference.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 ↗

Algorithm for haplotype resolution and block partitioning for partial XOR-genotype data.Semantic proximity Read ↗

CollHaps: a heuristic approach to haplotype inference by parsimony.Semantic proximity Read ↗

htSNPer1.0: software for haplotype block partition and htSNPs selection.Semantic proximity Read ↗

[Advances in haplotype analysis technique].Semantic proximity Read ↗

An improved heuristic for haplotype inference.Semantic proximity Read ↗

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