Skip to content
Exact Online String Matching

Shift Vector Matching

Implementation of Boyer-Moore using bit parallelism. It remembers characters matched during the last attempt.

Appeared in:

  • [85]: Peltola, H., Tarhio, J.: Alternative algorithms for bit-parallel string matching. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) String Processing and Information Retrieval, 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings. Lecture Notes in Computer Science, vol. 2857, pp. 80–94. Springer (2003), http://dx.doi.org/10.1007/978-3-540-39984-1_7 ↗