Skip to content
Exact Online String Matching

Packed Belazzougui-Raffinot

Efficient packed string matching algorithm which works in O(nm)O(nm) worst case time complexity

Appeared in:

  • [12]: Belazzougui, D., Raffinot, M.: Average optimal string matching in packed strings. In: Spirakis, P.G., Serna, M.J. (eds.) Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings. Lecture Notes in Computer Science, vol. 7878, pp. 37–48. Springer (2013), http://dx.doi.org/10.1007/978-3-642-38233-8_4 ↗