An Algorithm to Compute the Character Access Count Distribution for Pattern Matching Algorithms.
Tobias MarschallSven RahmannPublished in: Algorithms (2011)
Keyphrases
- pattern matching
- pattern matching algorithm
- learning algorithm
- boyer moore
- computational complexity
- string matching
- approximate pattern matching
- dynamic programming
- worst case
- matching process
- suffix tree
- compressed pattern matching
- hamming distance
- matching algorithm
- regular expressions
- lower and upper bounds
- suffix array
- similarity search
- bit parallel
- lower bound
- database systems
- search engine