A Fast String Searching Algorithm


An algorithm is presented that searches for the location, &#8220;<italic>i</italic>l&#8221; of the first occurrence of a character string, &#8220;<italic>pat</italic>,&#8221; in another string, &#8220;<italic>string</italic>.&#8221; During the search operation, the characters of <italic>pat</italic> are matched starting with the last character of <italic… (More)
DOI: 10.1145/359842.359859


2 Figures and Tables


Citations per Year

2,143 Citations

Semantic Scholar estimates that this publication has 2,143 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Boyer1977AFS, title={A Fast String Searching Algorithm}, author={Robert S. Boyer and J. Strother Moore}, journal={Commun. ACM}, year={1977}, volume={20}, pages={762-772} }