Efficient Branch and Bound Motif Finding with Maximum Accuracy based on Hashing.
Sanjay SoundarajanMichelle SalomonJin H. ParkPublished in: CCWC (2019)
Keyphrases
- branch and bound
- lower bound
- search algorithm
- motif finding
- column generation
- search space
- optimal solution
- branch and bound algorithm
- branch and bound procedure
- upper bound
- branch and bound method
- tree search
- multi dimensional
- search strategies
- combinatorial optimization
- knowledge discovery
- computational complexity
- machine learning
- neural network