Algorithm faster than BMH (Boyer–Moore–Horspool) Search

Question

Which algorithm would you use to search short substrings in short texts? By short I mean 5-10 characters for substring and 255 for the string. I'm thinking about choosing algorithm depending on input data length. Which algorithm is better for longer inputs?

Answer 1

Try Turbo-BM. However, IMO, with such short strings usual linear scan will suffice.

Answer 2

You can try Suffix Trees or Suffix Arrays. Both depend on the pattern length.