I think I have quite a good understanding of string algorithms. However, a couple of days ago, I came across this post: Find all pairs of strings in a set with Levenshtein distance < d
I was wondering, whether there are more string algorithms which do not have good worst-case guarantees but are good in practice. I guess these are not taught at some university string algorithms courses, as the professors want to teach algorithms with good theoretical running times
