Kernelization lower bound for Permutation Pattern Matching.
Ivan BliznetsMarek CyganPawel KomosaLukás MachPublished in: Inf. Process. Lett. (2015)
Keyphrases
- pattern matching
- lower bound
- upper bound
- branch and bound
- pattern matching algorithm
- regular expressions
- string matching
- lower and upper bounds
- objective function
- tree matching
- bit parallel
- optimal solution
- np hard
- boyer moore
- lossy compression
- data exchange
- nearest neighbor
- query processing
- online algorithms
- similarity measure
- database systems
- search engine
- databases