Implement exact string matching algorithms

[krzysztof-turowski]

• [ ] Hancart - On Simon's string searching algorithm (Simon-Hancart algorithm)
• [ ] Breslauer, Galil - Efficient comparison based string matching
• [ ] Colussi - Correctness and efficiency of string matching algorithms
• [ ] Colussi - Fastest pattern matching in strings
• [ ] Franek, Jennings, Smyth - A Simple Fast Hybrid Pattern-Matching Algorithm
• [ ] Breslauer - Saving comparisons in the Crochemore-Perrin string-matching algorithm
• [ ] Kärkkäinen, Ukkonen - Lempel-Ziv Parsing and Sublinear-Size Index Structures for String Matching
• [ ] Hume, Sunday - Fast string searching (Tuned Boyer Moore algorithm)
• [ ] Zhu, Takaoka - On improving the average case of the Boyer-Moore string matching algorithm
• [ ] Berry, Ravindran - A fast string matching algorithm and experimental results
• [ ] Smith - Experiments with a very fast substring search algorithm
• [ ] Raita - Tuning the Boyer-Moore-Horspool string searching algorithm
• [ ] Charras, Lecroq, Pehoushek - A very fast string matching algorithm for small alphabets and long patterns (Skip Search, KMP Skip Search, and Alpha Skip Search algorithms)
• [ ] Breslauer, Grossi, Mignosi - Simple real-time constant-space string matching
• [ ] Crochemore, Gąsieniec, Rytter - Constant-space string-matching in sublinear average time
• [ ] Gąsieniec, Plandowski, Rytter - Constant-space string matching with smaller number of comparisons: sequential sampling
• [ ] Gąsieniec, Kolpakov - Real-time string matching in sublinear space
• [ ] Hongbo, Nianmin, Haifeng - Fast Variants of the Backward-Oracle-Marching Algorithm
• [ ] Ahmed, Kaykobad, Chowdhury - A new string matching algorithm