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

  • $\begingroup$ (1) For a start, there's a 20-year-old Dan Gusfield's book. (2) Isn't "string algorithms" too broad? $\endgroup$ – Gassa Jul 6 '18 at 11:10
  • $\begingroup$ I know this book but I have not found in it any heuristics, like the one mentioned above. Could you please more specific? I don't think "string algorithms" is too broad and I don't think just "algorithms" would be too broad. $\endgroup$ – user2316602 Jul 6 '18 at 16:02

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.