Pages that link to "Item:Q2494824"

The following pages link to A polynomial case of the parsimony haplotyping problem (Q2494824):

Displaying 16 items.

• A new mathematical modeling for pure parsimony haplotyping problem (Q338689) (← links)
• Approximation algorithms for the minimum rainbow subgraph problem (Q709311) (← links)
• Solving haplotyping inference parsimony problem using a new basic polynomial formulation (Q929154) (← links)
• The phasing of heterozygous traits: Algorithms and complexity (Q929162) (← links)
• Mathematical programming in computational biology: an annotated bibliography (Q1662439) (← links)
• Improved approximation bounds for the minimum rainbow subgraph problem (Q1944047) (← links)
• Semiconservative quasispecies equations for polysomic genomes: the haploid case (Q2199267) (← links)
• Better lower and upper bounds for the minimum rainbow subgraph problem (Q2250438) (← links)
• Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms (Q2890436) (← links)
• Mathematical Models and Solutions for the Analysis of Human Genotypes (Q2948975) (← links)
• The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification (Q3060204) (← 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)
• Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems (Q3599136) (← links)
• Haplotype Inference Constrained by Plausible Haplotype Data (Q3637124) (← links)
• On the Approximability of Some Haplotyping Problems (Q3638438) (← links)