A very fast substring search algorithm

Communications of the ACM

Volumn 33, Issue 8, 1990, Pages 132-142

  Sunday, Daniel M ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

Algorithms; Boyer Moore; Knuth Morris Pratt; pattern; search; substring

Indexed keywords

COMPUTER METATHEORY - ALGORITHMIC LANGUAGES;

BOYER-MOORE ALGORITHM; KNUTH-MORRIS-PRATT ALGORITHM; MAXIMAL SHIFT ALGORITHM; OPTIMAL MISMATCH ALGORITHM; QUICK SEARCH ALGORITHM;

COMPUTER PROGRAMMING;

EID: 0025467860     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/79173.79184     Document Type: Article

References (4)

1. Boyer, R.S., and Moore, J.S. A fast string searching algorithm. Commun. ACM 20, 10 (Oct. 1977), 762-772.
2. Guibas, L.J., and Odlyzko, A.M. A new proof of the linearity of the Boyer-Moore String Searching Algorithm. SIAM J. Comput. 9, 4 (Nov. 1980), 672-682.
3. Knuth, D.E., Morris, J.H., and Pratt, V.R. Fast pattern matching in strings. Siam J. Comput. 6, 2 (June 1977), 323-350.
4. Smit, G.V. A comparison of three string matching algorithms. Softw.-Prac. and Exp. 12, 1 (Jan. 1982), 57-66.