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 heuristic algorithm for haplotype reconstruction from aligned weighted SNP fragments.

International journal of bioinformatics research and applications - 1 Jan 2013

Wu Jingli, Wang Jianxin, Chen Jian'er

Abstract excerpt

Haplotyping problem has been the subject of extensive research in recent years, and is one of the hottest areas of Computational Biology today. In this paper, we study the single individual Single Nucleotide Polymorphism (SNP) haplotype reconstruction problem. A heuristic algorithm is proposed for assembling a pair of haplotypes from a set of aligned weighted SNP fragments. Computational experiments indicate 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 Computational Biology
Share to Haplotypes

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

Share to Models, Genetic

Share to Polymorphism, Single Nucleotide

Source

Identifiers

PMID: 23207995
DOI: 10.1504/IJBRA.2013.050743

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 heuristic algorithm for haplotype reconstruction from aligned weighted SNP fragments.PMID 23207995Read ↗

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

Haplotype assembly from aligned weighted 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 ↗

A comparison of several algorithms for the single individual SNP haplotyping reconstruction problem.Semantic proximity Read ↗

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

Haplotype reconstruction from SNP fragments by minimum error correction.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 ↗

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

HapAssembler: a web server for haplotype assembly from SNP fragments using genetic algorithm.Semantic proximity Read ↗

An improved heuristic for haplotype inference.Semantic proximity Read ↗

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

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