Skip to content
Exact Online String Matching

Bit-Parallel Length Invariant Matcher

Quadratic worst case time algorithm using multiple words

Appeared in:

  • [75]: Külekci, M.O.: A method to overcome computer word size limitation in bit-parallel pattern matching. In: Hong, S., Nagamochi, H., Fukunaga, T. (eds.) Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings. Lecture Notes in Computer Science, vol. 5369, pp. 496–506. Springer (2008), http://dx.doi.org/10.1007/978-3-540-92182-0_45 ↗