On the Comparison Complexity of the String Prefix-Matching Problem.
Dany BreslauerLivio ColussiLaura TonioloPublished in: J. Algorithms (1998)
Keyphrases
- pattern matching
- string matching
- data structure
- approximate string matching
- edit distance
- matching process
- matching algorithm
- string similarity
- regular expressions
- case study
- approximate matching
- matching scheme
- shape matching
- image matching
- statistical analysis
- worst case
- computational cost
- affine invariant
- space complexity
- complexity analysis
- pairwise
- association rules
- computational complexity
- image sequences
- database
- bit parallel