Haplotype inference with pseudo-Boolean optimization
DOI10.1007/S10479-009-0675-4zbMATH Open1215.92043DBLPjournals/anor/GracaMLO11OpenAlexW2053481080WikidataQ58883964 ScholiaQ58883964MaRDI QIDQ545548FDOQ545548
Authors: Ana Graça, Inês Lynce, Arlindo L. Oliveira, Joao Marques-Silva
Publication date: 22 June 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0675-4
Recommendations
- Efficient Haplotype Inference with Pseudo-boolean Optimization
- The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability
- Boosting haplotype inference with local search
- Efficient and accurate haplotype inference by combining parsimony and pedigree information
- Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony
Applications of mathematical programming (90C90) Genetics and epigenetics (92D10) Boolean programming (90C09)
Cites Work
- Theory and Applications of Satisfiability Testing
- Title not available (Why is that?)
- Algorithms for Weighted Boolean Optimization
- Title not available (Why is that?)
- Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
- Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony
- Computational Methods for SNPs and Haplotype Inference
- Efficient Haplotype Inference with Pseudo-boolean Optimization
- Boosting haplotype inference with local search
Cited In (11)
- Efficient Haplotype Inference with Pseudo-boolean Optimization
- Title not available (Why is that?)
- Boosting haplotype inference with local search
- Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony
- Inferring phylogenetic trees using pseudo-Boolean optimization
- Efficient and accurate haplotype inference by combining parsimony and pedigree information
- New local search methods for partial MaxSAT
- Improved haplotype assembly using Xor genotypes
- Iterative and core-guided maxsat solving: a survey and assessment
- Particle swarm optimization for SNP haplotype reconstruction problem
- The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability
Uses Software
This page was built for publication: 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 Q545548)