A new mathematical modeling for pure parsimony haplotyping problem

DOI10.1016/j.mbs.2016.09.004zbMath1348.92108OpenAlexW2518674783WikidataQ39384254 ScholiaQ39384254MaRDI QIDQ338689

R. Feizabadi, H. R. Vaziri, Maziar Salahi, Mehri Bagherian

Publication date: 7 November 2016

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mbs.2016.09.004

zbMATH Keywords

genotypehaplotypemixed integer programingpure parsimony

Mathematics Subject Classification ID

Mixed integer programming (90C11) Medical applications (general) (92C50) Genetics and epigenetics (92D10)

Uses Software

• GERBIL

Cites Work

• Unnamed Item
• Solving haplotyping inference parsimony problem using a new basic polynomial formulation
• The phasing of heterozygous traits: Algorithms and complexity
• A polynomial case of the parsimony haplotyping problem
• Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
• A Class Representative Model for Pure Parsimony Haplotyping
• A Set-Covering Approach with Column Generation for Parsimony Haplotyping
• Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony
• The pure parsimony haplotyping problem: overview and computational advances

This page was built for publication: A new mathematical modeling for pure parsimony haplotyping problem