From profiles to patterns and back again: a branch and bound algorithm for finding near optimal motif profiles.
Eleazar EskinPublished in: RECOMB (2004)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- precedence constraints
- user profiles
- single machine scheduling problem
- maximum clique
- variable ordering
- np hard
- test problems
- optimal solution
- combinatorial optimization
- lagrangian relaxation
- randomly generated problems
- similarity measure
- finding an optimal solution
- max sat
- approximation algorithms