Kernelization lower bound for Permutation Pattern Matching.
Ivan BliznetsMarek CyganPawel KomosaLukás MachPublished in: CoRR (2014)
Keyphrases
- pattern matching
- lower bound
- upper bound
- branch and bound
- string matching
- objective function
- np hard
- regular expressions
- pattern matching algorithm
- matching process
- lower and upper bounds
- tree matching
- bit parallel
- hamming distance
- sufficiently accurate
- compressed text
- databases
- optimal solution
- exact and approximate
- suffix tree
- boyer moore