Griddings of Permutations and Hardness of Pattern Matching.
Vít JelínekMichal OplerJakub PekárekPublished in: MFCS (2021)
Keyphrases
- pattern matching
- regular expressions
- tree matching
- computational complexity
- phase transition
- pattern matching algorithm
- lossy compression
- matching process
- boyer moore
- approximate pattern matching
- hamming distance
- graph matching
- string matching
- matching strategy
- databases
- lower bound
- natural language
- database systems
- database