The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability.
Gerold JägerSharlee ClimerWeixiong ZhangPublished in: J. Discrete Algorithms (2016)
Keyphrases
- branch and bound
- integer programming
- branch and bound algorithm
- column generation
- max sat
- combinatorial optimization
- boolean satisfiability
- lower bound
- search algorithm
- cutting plane
- exact algorithms
- search space
- search strategies
- linear programming
- upper bound
- randomly generated
- combinatorial problems
- learning algorithm
- optimal solution
- integer program
- constraint programming
- tree search
- orders of magnitude
- dynamic programming
- exact methods
- sat problem