4 months ago by

France/Nantes/Institut du Thorax - INSERM UMR1087

EXACT STRING MATCHING ALGORITHMS / Christian Charras - Thierry Lecroq : http://www-igm.univ-mlv.fr/~lecroq/string/ "Brute Force algorithm
Deterministic Finite Automaton algorithm
Karp-Rabin algorithm
Shift Or algorithm
Morris-Pratt algorithm
Knuth-Morris-Pratt algorithm
Simon algorithm
Colussi algorithm
Galil-Giancarlo algorithm
Apostolico-Crochemore algorithm
Not So Naive algorithm
Boyer-Moore algorithm
Turbo BM algorithm
Apostolico-Giancarlo algorithm
Reverse Colussi algorithm
Horspool algorithm
Quick Search algorithm
Tuned Boyer-Moore algorithm
Zhu-Takaoka algorithm
Berry-Ravindran algorithm
Smith algorithm
Raita algorithm
Reverse Factor algorithm
Turbo Reverse Factor algorithm
Forward Dawg Matching algorithm
Backward Nondeterministic Dawg Matching algorithm
Backward Oracle Matching algorithm
Galil-Seiferas algorithm
Two Way algorithm
String Matching on Ordered Alphabets algorithm
Optimal Mismatch algorithm
Maximal Shift algorithm
Skip Search algorithm
KMP Skip Search algorithm
Alpha Skip Search algorithm"

and their implementations in C...

Whats wrong with

`strstr`

, or`grep`

‽950Nothing, but i need more algorithms with scientific approach and compare them on different data sets.

0I am predicting, it will be hard to beat

`strstr`

or`pcmpestri`

unless you do some precomputation on the haystack (suffixtree etc.).950Do you have python library?

0