In all cases it can be seen that … [Boyer's and Moore's 1977 string matching algorithm] … three algorithms [brute force, Knuth Morris Pratt 1977, and Karp and Rabin's "rolling" hash]. … [p. 600] Thus it can be seen that in … [Boyer and Moore's 1977 string matching algorithm] has a faster running time than any of the other … [about 20% faster] …
Google-1
Google-2
Copyright clearance needed for quotation.