A Look-Ahead Branch and Bound Pruning Scheme for Trie-Based Approximate String Matching.
Ghada BadrB. John OommenPublished in: CORES (2005)
Keyphrases
- branch and bound
- approximate string matching
- search space
- tree search
- branch and bound algorithm
- lower bound
- mini bucket
- search algorithm
- string matching
- upper bound
- optimal solution
- combinatorial optimization
- edit distance
- branch and bound procedure
- data structure
- n gram
- exact and approximate
- branch and bound method
- pattern matching
- metaheuristic
- databases
- suffix tree
- indexing techniques
- objective function
- database
- probabilistic model
- neural network