Skip to content

BNDMq Long

Modification of Backward-Nondeterministic-DAWG-Matching for long patterns. It increases the effective alphabet size by using overlapping q-grams.

Appeared in:

  • [39]: Durian, B., Peltola, H., Salmela, L., Tarhio, J.: Bit-parallel search algorithms for long patterns. In: Festa, P. (ed.) Experimental Algorithms, 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings. Lecture Notes in Computer Science, vol. 6049, pp. 129–140. Springer (2010), Exact Online String Matching Bibliography 19