A practical exact algorithm for the individual haplotyping problem MEC/GI

DOI10.1007/S00453-009-9288-1zbMath1191.68841OpenAlexW2038447328MaRDI QIDQ848946

Jianxin Wang, Minzhu Xie, Jian'er Chen

Publication date: 23 February 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9288-1

zbMATH Keywords

NP-hardnessgenotypeparameterized algorithmhaplotypeSNP (single nucleotide polymorphism)

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (3)

Maximum likelihood model based on minor allele frequencies and weighted Max-SAT formulation for haplotype assembly ⋮ Improved kernel results for some FPT problems based on simple observations ⋮ Improved haplotype assembly using Xor genotypes

Cites Work

• An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs
• Parameterized computation and complexity: a new approach dealing with NP-hardness
• Computational Methods for SNPs and Haplotype Inference
• Experimental and Efficient Algorithms
• Unnamed Item

This page was built for publication: A practical exact algorithm for the individual haplotyping problem MEC/GI