Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony.
Luca Di GasperoAndrea RoliPublished in: J. Algorithms (2008)
Keyphrases
- stochastic local search
- haplotype inference
- randomly generated
- solving hard
- branch and bound algorithm
- random sat instances
- satisfiability problem
- entropy minimization
- max sat
- answer set programming
- phase transition
- sat instances
- sat problem
- multi population
- genetic algorithm
- tree search
- sat solvers
- np complete
- dynamic programming
- evolutionary algorithm
- knowledge base