Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences

Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara. Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences. In Simone Faro, Domenico Cantone, editors, 18th International Symposium on Experimental Algorithms, SEA 2020, June 16-18, 2020, Catania, Italy. Volume 160 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

@inproceedings{KobayashiHYS20,
  title = {Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences},
  author = {Satoshi Kobayashi and Diptarama Hendrian and Ryo Yoshinaka and Ayumi Shinohara},
  year = {2020},
  doi = {10.4230/LIPIcs.SEA.2020.13},
  url = {https://doi.org/10.4230/LIPIcs.SEA.2020.13},
  researchr = {https://researchr.org/publication/KobayashiHYS20},
  cites = {0},
  citedby = {0},
  booktitle = {18th International Symposium on Experimental Algorithms, SEA 2020, June 16-18, 2020, Catania, Italy},
  editor = {Simone Faro and Domenico Cantone},
  volume = {160},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-148-1},
}