Since the Boyer-Moore algorithm was described in 1977, … badly with current practice. We describe two algorithms … architectures and compilers. These new variants are members … neglected, fast form of Boyer-Moore. We present a … [for skip loop, match, and shift] that can be used to design an algorithm most appropriate … [p. 1237] For general purpose use, we recommend the … [Tuned Boyer-Moore] and LC [Least Cost skip character]
Google-1
Google-2
Copyright clearance needed for quotation.