论文信息 - On improving the worst case running time of the Boyer-Moore string matching algorithm - 字舞流文

On improving the worst case running time of the Boyer-Moore string matching algorithm

It is shown how to modify the Boyer-Moore string matching algorithm so that its worst case running time is linear even when multiple occurrences of the pattern are present in the text.

[1] R. Nigel Horspool,et al. Practical fast searching in strings , 1980, Softw. Pract. Exp..

[2] Andrew Chi-Chih Yao,et al. The Complexity of Pattern Matching for a Random String , 1977, SIAM J. Comput..

[3] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.

[4] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[5] S. K. Bandyopadhyay. Comment on weighted increment linear search for scatter tables , 1977, CACM.

[6] M. Schützenberger,et al. The equation $a^M=b^Nc^P$ in a free group. , 1962 .

[7] Robert S. Boyer,et al. A fast string searching algorithm , 1977, CACM.

[8] Leonidas J. Guibas,et al. A new proof of the linearity of the Boyer-Moore string searching algorithm , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[9] Edward M. McCreight,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[10] Zvi Galil,et al. On improving the worst case running time of the Boyer-Moore string matching algorithm , 1978, CACM.