Detecting Patterns Can Be Hard: Circuit Lower Bounds for the String Matching Problem.
Alexander GolovnevDaniel ReichmanIgor ShinkarPublished in: CoRR (2017)
Keyphrases
- string matching
- lower bound
- pattern matching algorithm
- repeated patterns
- pattern matching
- approximate string matching
- exact and approximate
- edit distance
- upper bound
- approximate matching
- objective function
- suffix tree
- aho corasick
- regular expressions
- suffix array
- branch and bound
- frequent patterns
- database
- data integration
- similarity measure