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 model of higher accuracy for the individual haplotyping problem based on weighted SNP fragments and genotype with errors.

Bioinformatics (Oxford, England) - 1 Jul 2008

Xie Minzhu, Wang Jianxin, Chen Jianer

Abstract excerpt

MOTIVATION: In genetic studies of complex diseases, haplotypes provide more information than genotypes. However, haplotyping is much more difficult than genotyping using biological techniques. Therefore effective computational techniques have been in demand. The individual haplotyping problem is the computational problem of inducing a pair of haplotypes from an individual's aligned SNP fragments. Based on various...

Read the complete abstract on PubMed

Topics

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

Share to Base Sequence
Share to Chromosome Mapping
Share to Genetic Linkage

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

Share to Genotype

Share to Haplotypes

Share to Models, Genetic

Share to Molecular Sequence Data

Share to Sequence Analysis, DNA

Source

Open in PubMed Open full text

Identifiers

PMID: 18586702
DOI: 10.1093/bioinformatics/btn147
PMCID: PMC2718625

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

A model of higher accuracy for the individual haplotyping problem based on weighted SNP fragments and genotype with errors.PMID 18586702Read ↗

Research on parameterized algorithms of the individual haplotyping problem.Semantic proximity Read ↗

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

Haplotype reconstruction from SNP fragments by minimum error correction.Semantic proximity Read ↗

A heuristic algorithm for haplotype reconstruction from aligned weighted SNP fragments.Semantic proximity Read ↗

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

Efficient fast heuristic algorithms for minimum error correction haplotyping from SNP fragments.Semantic proximity Read ↗

Using genetic algorithm in reconstructing single individual haplotype with minimum error correction.Semantic proximity Read ↗

A highly accurate heuristic algorithm for the haplotype assembly problem.Semantic proximity Read ↗

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

A Markov chain model for haplotype assembly from SNP fragments.Semantic proximity Read ↗

SpeedHap: an accurate heuristic for the single individual SNP haplotyping problem with many gaps, high reading error rate and low coverage.Semantic proximity Read ↗

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

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