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 highly accurate heuristic algorithm for the haplotype assembly problem.

BMC genomics - 1 Jan 2013

Deng Fei, Cui Wenjuan, Wang Lusheng

Abstract excerpt

BACKGROUND: Single nucleotide polymorphisms (SNPs) are the most common form of genetic variation in human DNA. The sequence of SNPs in each of the two copies of a given chromosome in a diploid organism is referred to as a haplotype. Haplotype information has many applications such as gene disease diagnoses, drug design, etc. The haplotype assembly problem is defined as follows: Given a set of fragments sequenced...

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 DNA

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

Share to Haplotypes

Share to Polymorphism, Single Nucleotide

Share to Sequence Analysis, DNA

Source

Open in PubMed Open full text

Identifiers

PMID: 23445458
DOI: 10.1186/1471-2164-14-S2-S2
PMCID: PMC3582451

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 highly accurate heuristic algorithm for the haplotype assembly problem.PMID 23445458Read ↗

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

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

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

Better ILP models for haplotype assembly.Semantic proximity Read ↗

A fast and accurate algorithm for diploid individual haplotype reconstruction.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 ↗

An improved heuristic for haplotype inference.Semantic proximity Read ↗

MAtCHap: an ultra fast algorithm for solving the single individual haplotype assembly problemSemantic proximity Read ↗

FNphasing: a novel fast heuristic algorithm for haplotype phasing based on flow network model.Semantic proximity Read ↗

Memory efficient assembly of human genome.Semantic proximity Read ↗

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

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

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