Average-Case Optimal Approximate Circular String Matching.
Carl BartonCostas S. IliopoulosSolon P. PissisPublished in: LATA (2015)
Keyphrases
- average case
- string matching
- worst case
- approximate matching
- worst case analysis
- pattern matching
- exact and approximate
- uniform distribution
- approximate string matching
- edit distance
- upper bound
- lower bound
- dynamic programming
- pattern recognition
- vc dimension
- optimal solution
- suffix array
- computational complexity
- suffix tree
- database
- np hard
- supervised learning
- nearest neighbor