A Class Representative Model for Pure Parsimony Haplotyping
From MaRDI portal
Publication:2899051
DOI10.1287/ijoc.1090.0333zbMath1243.90134OpenAlexW2105206980MaRDI 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
Integer programming (90C10) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)
Related Items (10)
A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems ⋮ 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 ⋮ Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs ⋮ A supernodal formulation of vertex colouring with applications in course timetabling ⋮ A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph ⋮ Mathematical Models and Solutions for the Analysis of Human Genotypes ⋮ A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem ⋮ The pure parsimony haplotyping problem: overview and computational advances ⋮ Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope
This page was built for publication: A Class Representative Model for Pure Parsimony Haplotyping
