Revision as of 15:34, 27 August 2014 edit 24.33.70.144 (talk) →Stubs: Alpha Skip Search, by Daniel Pehoushek ← Previous edit		Revision as of 15:40, 27 August 2014 edit undo 24.33.70.144 (talk) →Single pattern algorithms Next edit →
Line 48: The '''Boyer–Moore string search algorithm''' has been the standard benchmark for the practical string search literature.<ref name=":0">{{cite journal \|last=Hume \|last2=Sunday \|year=1991 \|title=Fast String Searching \|journal=Software: Practice and Experience \|volume=21 \|issue=11 \|pages=1221–1248 \|doi=10.1002/spe.4380211105 }}</ref> The log base in Alpha Skip Search is the alphabet size. === Algorithms using a finite set of patterns ===

String-searching algorithm: Difference between revisions