Algorithm Faster BMH (Boyer-Moore-Horspool) Search

Question

What algorithm would you use to find short substrings in short texts? In short, I mean 5-10 characters for a substring and 255 for a string. I am thinking about choosing an algorithm depending on the length of the input. Which algorithm is best suited for longer inputs?

Answer 1

Try Turbo-BM . However, an IMO with such short lines will be sufficient for a conventional linear scan.

Answer 2

If you are looking for an algorithm better than Boyer Moore, then you are asking for a mixed answer.

, Boyer Moore . .

: Boyer Moore, , .

RAM ( ).

: . .

5 200- , - 200 , - 5.

, , . , , . .

, . .

, , ( ) .

Answer 3

@anon @
: Railgun_Quadruplet

C 2,3,4 160 , http://www.sanmayce.com/Railgun/index.html#Heavy-Search-Hustle. .

The article is also available at: http://www.codeproject.com/KB/cpp/Railgun_Quadruplet.aspx

Answer 4

You can try Suffix Trees or Suffix arrays . Both depend on the length of the picture.