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

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

IEEE/ACM transactions on computational biology and bioinformatics - 1 Jan 2000

Genovese Loredana M, Geraci Filippo, Pellegrini Marco

Abstract excerpt

Single nucleotide polymorphism (SNP) is the most frequent form of DNA variation. The set of SNP's present in a chromosome (called the haplotype) is of interest in a wide area of applications in molecular biology and biomedicine, including diagnostic and medical therapy. In this paper we propose a new heuristic method for the problem of haplotype reconstruction for (portions of) a pair of homologous human...

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

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

Share to DNA Mutational Analysis

Share to Haplotypes

Share to Molecular Sequence Data

Share to Polymorphism, Single Nucleotide

Share to Sensitivity and Specificity

Share to Sequence Analysis, DNA

Source

Identifiers

PMID: 18989037
DOI: 10.1109/TCBB.2008.67

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

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

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 ↗

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

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

WhatsHap: Weighted Haplotype Assembly for Future-Generation Sequencing Reads.Semantic proximity Read ↗

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

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

PWHATSHAP: efficient haplotyping for future generation sequencing.Semantic proximity Read ↗

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

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

HapCHAT: Adaptive haplotype assembly for efficiently leveraging high coverage in long readsSemantic proximity Read ↗

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