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

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

International journal of bioinformatics research and applications - 1 Jan 2015

Wang Tai-Chun, Taheri Javid, Zomaya Albert Y

Abstract excerpt

Single nucleotide polymorphism studies have recently received significant amount of attention from researchers in many life science disciplines. Previous researches indicated that a series of SNPs from the same chromosome, called haplotype, contains more information than individual SNPs. Hence, discovering ways to reconstruct reliable Single Individual Haplotypes becomes one of the core issues in the whole-genome...

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 DNA

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

Source

Identifiers

PMID: 25667383
DOI: 10.1504/IJBRA.2015.067336

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

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

Using genetic algorithm in reconstructing single individual haplotype with 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 ↗

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

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

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

Parameterised algorithms of the individual haplotyping problem with gaps.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 ↗

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

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

A parsimonious tree-grow method for haplotype inference.Semantic proximity Read ↗

An improved heuristic for haplotype inference.Semantic proximity Read ↗

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