Pages that link to "Item:Q3563606"

The following pages link to The pure parsimony haplotyping problem: overview and computational advances (Q3563606):

Displayed 4 items.

• A new mathematical modeling for pure parsimony haplotyping problem (Q338689) ‎ (← links)
• Exact and heuristic approaches for the set cover with pairs problem (Q691479) ‎ (← links)
• Better lower and upper bounds for the minimum rainbow subgraph problem (Q2250438) ‎ (← links)
• Effective heuristics for the Set Covering with Pairs Problem (Q3002555) ‎ (← links)