Average-Case Optimal Approximate Circular String Matching.
Carl BartonCostas S. IliopoulosSolon P. PissisPublished in: CoRR (2014)
Keyphrases
- average case
- string matching
- worst case
- approximate matching
- worst case analysis
- exact and approximate
- pattern matching
- uniform distribution
- approximate string matching
- suffix tree
- upper bound
- edit distance
- lower bound
- average case complexity
- metadata
- integrity constraints
- dynamic programming
- np hard
- pattern recognition
- data structure
- optimal solution
- computational complexity
- suffix array
- training data
- feature extraction