Haplotype inference with pseudo-Boolean optimization

DOI10.1007/s10479-009-0675-4zbMath1215.92043DBLPjournals/anor/GracaMLO11OpenAlexW2053481080WikidataQ58883964 ScholiaQ58883964MaRDI QIDQ545548

Ana Graça, Arlindo L. Oliveira, Inês Lynce, João P. 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

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Boolean programming (90C09) Genetics and epigenetics (92D10)

Related Items (3)

The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability ⋮ New local search methods for partial MaxSAT ⋮ Iterative and core-guided maxsat solving: a survey and assessment

Uses Software

• MiniSat
• Pueblo
• PBS
• RPOLY

Cites Work

• Unnamed Item
• Unnamed Item
• Boosting haplotype inference with local search
• 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
• Algorithms for Weighted Boolean Optimization
• Theory and Applications of Satisfiability Testing
• Computational Methods for SNPs and Haplotype Inference
• Efficient Haplotype Inference with Pseudo-boolean Optimization

This page was built for publication: Haplotype inference with pseudo-Boolean optimization