A Class Representative Model for Pure Parsimony Haplotyping
From MaRDI portal
Publication:2899051
DOI10.1287/ijoc.1090.0333zbMath1243.90134MaRDI QIDQ2899051
Martine Labbé, Daniele Catanzaro, Alessandra Godi
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1090.0333
90C10: Integer programming
92D10: Genetics and epigenetics
92-08: Computational methods for problems pertaining to biology
Related Items
A new mathematical modeling for pure parsimony haplotyping problem, A supernodal formulation of vertex colouring with applications in course timetabling, A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem, Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs, Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope, A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph, The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability, A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems, Mathematical Models and Solutions for the Analysis of Human Genotypes, The pure parsimony haplotyping problem: overview and computational advances
