The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings.
Frédérique BassinoTsinjo RakotoarimalalaAndrea SportielloPublished in: AofA (2020)
Keyphrases
- pattern matching
- string matching
- hamming distance
- pattern matching algorithm
- matching strategy
- exact and approximate
- regular expressions
- matching process
- suffix array
- boyer moore
- edit distance
- data model
- multi dimensional
- approximate string matching
- natural language
- tree matching
- database systems
- bit parallel
- approximate pattern matching
- search engine