Pages that link to "Item:Q2628808"

The following pages link to The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability (Q2628808):

Displaying 8 items.

• Mod/Resc parsimony inference: theory and application (Q418168) (← links)
• Solving haplotype inference problem with non-genotyped founders via integer linear programming (Q434198) (← links)
• Mathematical properties and bounds on haplotyping populations by pure parsimony (Q541881) (← links)
• Haplotype inference with pseudo-Boolean optimization (Q545548) (← links)
• Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics (Q555381) (← links)
• Boosting haplotype inference with local search (Q941674) (← links)
• A set-covering approach with column generation for parsimony haplotyping (Q2901055) (← links)
• Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony (Q3527694) (← links)