Pages that link to "Item:Q3563606"

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

Displaying 14 items.

• A new mathematical modeling for pure parsimony haplotyping problem (Q338689) (← links)
• Mathematical properties and bounds on haplotyping populations by pure parsimony (Q541881) (← links)
• Exact and heuristic approaches for the set cover with pairs problem (Q691479) (← links)
• The phasing of heterozygous traits: Algorithms and complexity (Q929162) (← links)
• PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion (Q1715640) (← links)
• The haplotyping problem: an overview of computational models and solutions (Q1884294) (← links)
• A guided tour to computational haplotyping (Q2011635) (← links)
• Better lower and upper bounds for the minimum rainbow subgraph problem (Q2250438) (← links)
• A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295) (← links)
• A polynomial case of the parsimony haplotyping problem (Q2494824) (← links)
• Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms (Q2890436) (← links)
• A class representative model for pure parsimony haplotyping (Q2899051) (← links)
• Effective heuristics for the Set Covering with Pairs Problem (Q3002555) (← links)
• A New Nuisance-Parameter Elimination Method With Application to the Unordered Homologous Chromosome Pairs Problem (Q3225810) (← links)