Solving haplotyping inference parsimony problem using a new basic polynomial formulation

DOI10.1016/j.camwa.2006.12.095zbMath1137.92022OpenAlexW2016778388MaRDI QIDQ929154

Alessandra Godi, Martine Labbé, Leonardo Tininini, Paola Bertolazzi

Publication date: 12 June 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2006.12.095

zbMATH Keywords

integer linear programming

Mathematics Subject Classification ID

Problems related to evolution (92D15) Integer programming (90C10) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Related Items (6)

The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability ⋮ A new mathematical modeling for pure parsimony haplotyping problem ⋮ Lexicographical order in integer programming ⋮ Mathematical Models and Solutions for the Analysis of Human Genotypes ⋮ The pure parsimony haplotyping problem: overview and computational advances ⋮ Exact and heuristic approaches for the set cover with pairs problem

Cites Work

• A polynomial case of the parsimony haplotyping problem
• A New Formulation and Resolution Method for the p-Center Problem
• Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
• A New Algorithm for Generating All the Maximal Independent Sets

This page was built for publication: Solving haplotyping inference parsimony problem using a new basic polynomial formulation