A weak approach to suffix automata simulation for exact and approximate string matching.

Simone Faro Stefano Scafiti

Published in: Theor. Comput. Sci. (2022)

Keyphrases

exact and approximate
string matching
suffix tree
edit distance
regular expressions
pattern matching
approximate string matching
suffix array
approximate matching
data structure
lower bound
database
pattern recognition
data sets
distance measure
dynamic programming
similarity measure
compressed text
query evaluation