Bit-Parallel Branch and Bound Algorithm for Transposition Invariant LCS.
Kjell LemströmGonzalo NavarroYoan J. PinzónPublished in: SPIRE (2004)
Keyphrases
- branch and bound algorithm
- bit parallel
- pattern matching
- lower bound
- branch and bound
- optimal solution
- upper bound
- np hard
- regular expressions
- lower bounding
- combinatorial optimization
- randomly generated problems
- learning classifier systems
- precedence constraints
- single machine scheduling problem
- variable ordering
- lagrangian relaxation
- approximation algorithms
- mixed integer linear programming
- finding an optimal solution
- maximum clique
- upper bounding
- search space
- max sat
- integer variables
- search algorithm
- computational complexity
- database