BNDM with Extended Shifts

Modification of Backward-Nondeterministic-DAWG-Matching for long patterns. The automaton is constructed over a superimposed pattern constructed on the $m/w$ consecutive factors of the input pattern

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), http://dx.doi.org/10.1007/978-3-642-13193-6_12 ↗ Exact Online String Matching Bibliography 19