字串比對演算法

Exact string matching algorithms
http://www-igm.univ-mlv.fr/~lecroq/string/index.html

字串比對在資訊領域中常常用到，像是把問題化作兩條字串去做相似度的評比來求得近似的答案。這網頁中如列了許多種演算法，並有applet輔助說明。

演算法列表如下：

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

老實說，我還很弱，還沒看懂大部分，有空閒再來研究研究。