Pages that link to "Item:Q2890436"

The following pages link to Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms (Q2890436):

Displaying 24 items.

• A new mathematical modeling for pure parsimony haplotyping problem (Q338689) (← links)
• Phylogeny- and parsimony-based haplotype inference with constraints (Q418170) (← 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)
• Exact and heuristic approaches for the set cover with pairs problem (Q691479) (← 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)
• Boosting haplotype inference with local search (Q941674) (← links)
• Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices (Q1026186) (← links)
• Mathematical programming in computational biology: an annotated bibliography (Q1662439) (← links)
• Improved approximation bounds for the minimum rainbow subgraph problem (Q1944047) (← links)
• Better lower and upper bounds for the minimum rainbow subgraph problem (Q2250438) (← links)
• A polynomial case of the parsimony haplotyping problem (Q2494824) (← links)
• The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability (Q2628808) (← links)
• MINIMUM MOSAIC INFERENCE OF A SET OF RECOMBINANTS (Q2841985) (← links)
• Mathematical Models and Solutions for the Analysis of Human Genotypes (Q2948975) (← links)
• Haplotype Inferring Via Galled-Tree Networks Is NP-Complete (Q3511338) (← 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)
• Comparing Integer Linear Programming to SAT-Solving for Hard Problems in Computational and Systems Biology (Q5041127) (← links)