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

Better ILP models for haplotype assembly.

BMC bioinformatics - 19 Feb 2018

Etemadi Maryam, Bagherian Mehri, Chen Zhi-Zhong, Wang Lusheng

Abstract excerpt

BACKGROUND: The haplotype assembly problem for diploid is to find a pair of haplotypes from a given set of aligned Single Nucleotide Polymorphism (SNP) fragments (reads). It has many applications in association studies, drug design, and genetic research. Since this problem is computationally hard, both heuristic and exact algorithms have been designed for it. Although exact algorithms are much slower, they are...

Read the complete abstract on PubMed

Topics

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

Share to Algorithms
Share to Haplotypes
Share to Heterozygote

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

Share to Models, Genetic

Share to Polymorphism, Single Nucleotide

Source

Open in PubMed Open full text

Identifiers

PMID: 29504891
DOI: 10.1186/s12859-018-2012-x
PMCID: PMC6389102

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

Better ILP models for haplotype assembly.PMID 29504891Read ↗

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

Improved haplotype assembly using Xor genotypes.Semantic proximity Read ↗

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

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

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

Effective haplotype assembly via maximum Boolean satisfiability.Semantic proximity Read ↗

HapCol: accurate and memory-efficient haplotype assembly from long reads.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 ↗

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

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

The haplotype assembly model with genotype information and iterative local-exhaustive search algorithm.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.