Pages that link to "Item:Q555381"
From MaRDI portal
The following pages link to Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics (Q555381):
Displaying 13 items.
- A new mathematical modeling for pure parsimony haplotyping problem (Q338689) (← links)
- Mathematical properties and bounds on haplotyping populations by pure parsimony (Q541881) (← links)
- Solving haplotyping inference parsimony problem using a new basic polynomial formulation (Q929154) (← links)
- Boosting haplotype inference with local search (Q941674) (← links)
- A fast haplotype inference method for large population genotype data (Q1023852) (← links)
- The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability (Q2628808) (← links)
- Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms (Q2890436) (← links)
- A class representative model for pure parsimony haplotyping (Q2899051) (← 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)
- The pure parsimony haplotyping problem: overview and computational advances (Q3563606) (← links)
- Haplotype Inference Constrained by Plausible Haplotype Data (Q3637124) (← links)
- Research in Computational Molecular Biology (Q5706906) (← links)