Pages that link to "Item:Q2899051"
From MaRDI portal
The following pages link to A class representative model for pure parsimony haplotyping (Q2899051):
Displaying 12 items.
- A new mathematical modeling for pure parsimony haplotyping problem (Q338689) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem (Q632643) (← links)
- Solving haplotyping inference parsimony problem using a new basic polynomial formulation (Q929154) (← links)
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs (Q1652711) (← links)
- PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion (Q1715640) (← links)
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) (← links)
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463) (← links)
- The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability (Q2628808) (← links)
- A combined parallel Lagrangian decomposition and cutting-plane generation for maximum stable set problems (Q2883604) (← links)
- Mathematical Models and Solutions for the Analysis of Human Genotypes (Q2948975) (← links)
- The pure parsimony haplotyping problem: overview and computational advances (Q3563606) (← links)
