BNDM for Long patterns

Modification of Backward-Nondeterministic-DAWG-Matching using multiple words for simulating the nondeterministic automata of long patterns.

Appeared in:

• [83]: Navarro, G., Raffinot, M.: Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmics 5, 4 (2000), http://doi.acm.org/10.1145/351827.384246 ↗