NobleBlocks
Public

A fast string searching algorithm

Published in Communications of the ACM • Oct 1, 1977
NobleIDNI0P66W41R04S23
Authors:
Robert S. Boyer
,
J. Strother Moore

Abstract

An algorithm is presented that searches for the location, “ i l” of the first occurrence of a character string, “ pat ,” in another string, “ string .” During the search operation, the characters of pat are matched starting with the last character of pat . The information gained by starting the matc...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!