Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automata

Gonzalo Navarro, Mathieu Raffinot. Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automata. ACM Journal of Experimental Algorithmics, 5:4, 2000. [doi]

@article{NavarroR00,
  title = {Fast and Flexible String Matching by Combining Bit-Parallelism and Suffix Automata},
  author = {Gonzalo Navarro and Mathieu Raffinot},
  year = {2000},
  url = {http://www.jea.acm.org/2000/NavarroString},
  researchr = {https://researchr.org/publication/NavarroR00},
  cites = {0},
  citedby = {0},
  journal = {ACM Journal of Experimental Algorithmics},
  volume = {5},
  pages = {4},
}