Comets (Constrained Optimization of Multistate Energies by Tree Search): A Provable and Efficient Algorithm to Optimize Binding Affinity and Specificity with Respect to Sequence.
Mark HallenBruce Randall DonaldPublished in: RECOMB (2015)
Keyphrases
- special case
- constrained optimization
- np hard
- computational complexity
- objective function
- tree search
- dynamic programming
- depth first search
- learning algorithm
- memory efficient
- neural network
- cost function
- optimization algorithm
- tree search algorithm
- constrained optimization problems
- maximum flow
- augmented lagrangian
- nearest neighbor
- search space
- monte carlo
- alpha beta
- penalty function
- constraint propagation
- combinatorial optimization
- tree structure
- genetic algorithm