On the shift-table in Boyer-Moore’s String Matching Algorithm

  • Wang
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

… with those of x, until a matching substring in y is found or until all such … a brute force approach that requires backtracking on the string y in the event of a mismatch. Knuth, Morris and Pratt …

Cite

CITATION STYLE

APA

Wang. (2009). On the shift-table in Boyer-Moore’s String Matching Algorithm. International Journal of Digital Content Technology and Its Applications. https://doi.org/10.4156/jdcta.vol3.issue4.1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free