Efficient Haplotype Inference with Pseudo-boolean Optimization
From MaRDI portal
Recommendations
- Haplotype inference with pseudo-Boolean optimization
- Efficient and accurate haplotype inference by combining parsimony and pedigree information
- Boosting haplotype inference with local search
- An efficient algorithm for haplotype inference on pedigrees with a small number of recombinants
- A fast haplotype inference method for large population genotype data
Cited in
(14)- Improved haplotype assembly using Xor genotypes
- The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability
- Writing declarative specifications for clauses
- Efficient and accurate haplotype inference by combining parsimony and pedigree information
- Mathematical models and solutions for the analysis of human genotypes
- The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences
- Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony
- The pure parsimony haplotyping problem: overview and computational advances
- Finding all maximal perfect haplotype blocks in linear time
- Mathematical properties and bounds on haplotyping populations by pure parsimony
- Haplotype inference with pseudo-Boolean optimization
- Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics
- scientific article; zbMATH DE number 7716305 (Why is no real title available?)
- Boosting haplotype inference with local search
This page was built for publication: Efficient Haplotype Inference with Pseudo-boolean Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429358)
