A Fast String Searching Algorithm

Communications of the ACM

Volumn 20, Issue 10, 1977, Pages 762-772

  Boyer, Robert S ^a   Moore, J Strother ^b  

^a SRI INTERNATIONAL   (United States)

^b PALO ALTO RESEARCH CENTER   (United States)

Author keywords

bibliographic search; computational complexity; information retrieval; linear time bound; pattern matching; text editing

Indexed keywords

COMPUTER OPERATING SYSTEMS; INFORMATION SCIENCE - INFORMATION RETRIEVAL;

COMPUTER PROGRAMMING;

EID: 0017547820     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/359842.359859     Document Type: Article

References (5)

1. Aho, A.V., and Corasick, M.J. Fast pattern matching: An aid to bibliographic search. Comm. ACM 18, 6 (June, 1975), 333-340.
2. Beeler, M., Gosper, R.W., and Schroeppel, R. Hakmem. Memo No. 239, M.I.T. Artificial Intelligence Lab., M.I.T., Cambridge, Mass., Feb. 29, 1972.
3. Dewey, G. Relativ Frequency of English Speech Sounds. Harvard U. Press, Cambridge, Mass., 1923, p. 185.
4. Knuth, D.E., Morris, J.H., and Pratt, V.R. Fast pattern matching in strings. TR CS-74-440, Stanford U., Stanford, Calif., 1974.
5. Knuth, D.E., Morris, J.H., and Pratt, V.R. Fast pattern matching in strings, (to appear in SIAM J. Comput.).