Best reordered string-matching algorithms
Cheng We · Jisuanji gongcheng yu sheji · 2004
In order to acquire high efficiency of the string-matching in an environment with large amount of date, the algorithm works out a compare-sequence, which the string-matching has the longest average jump, by using the power coming from probability,and then compares the words in this sequence. Finally, the performance of the algorithm is studied, and the applied area of the algorithm is found by comparing with the brute force algorithm.