Pages that link to "Item:Q929154"

The following pages link to Solving haplotyping inference parsimony problem using a new basic polynomial formulation (Q929154):

Displaying 10 items.

• A new mathematical modeling for pure parsimony haplotyping problem (Q338689) (← links)
• Solving haplotype inference problem with non-genotyped founders via integer linear programming (Q434198) (← links)
• Exact and heuristic approaches for the set cover with pairs problem (Q691479) (← links)
• Lexicographical order in integer programming (Q2405486) (← links)
• The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability (Q2628808) (← links)
• A class representative model for pure parsimony haplotyping (Q2899051) (← links)
• A set-covering approach with column generation for parsimony haplotyping (Q2901055) (← links)
• Mathematical Models and Solutions for the Analysis of Human Genotypes (Q2948975) (← links)
• A New Nuisance-Parameter Elimination Method With Application to the Unordered Homologous Chromosome Pairs Problem (Q3225810) (← links)
• The pure parsimony haplotyping problem: overview and computational advances (Q3563606) (← links)