Transcription of A Fast String Searching Algorithm
{{id}} {{{paragraph}}}
Example: tourism industry
A Fast String Searching Algorithm
1. Introduction Programming Techniques G. Manacher, Graham Editors A Fast String Searching Algorithm Robert S. Boyer Stanford Research Institute J Strother Moore Xerox Palo Alto Research Center An Algorithm is presented that searches for the location, "i," 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 match at the end of the pattern often allows the Algorithm to proceed in large jumps through the text being searched. Thus the Algorithm has the unusual property that, in most cases, not all of the first i characters of String are inspected.
This work was partially supported by ONR Contract N00014-75-C- 0816; JS. Moore was in the Computer Science Laboratory, Xerox Palo Alto Research Center, Palo Alto, CA 94304, when this work was done. His current address is Computer Science Laboratory, SRI International, Menlo Park, CA 94025. 762
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: