String indexing for top-k close consecutive occurrences

Bille, P., Gørtz, I. L., Pedersen, M. R., Rotenberg, E., & Steiner, T. A. (2022). String indexing for top-k close consecutive occurrences. Theoretical Computer Science, 927, 133–147. https://doi.org/10.1016/j.tcs.2022.06.004

Bille, Philip, et al. “String indexing for top-k close consecutive occurrences.” Theoretical Computer Science, vol. 927, 2022, pp. 133–47, https://doi.org/10.1016/j.tcs.2022.06.004.

Bille, Philip, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, and Teresa Anna Steiner. 2022. “String indexing for top-k close consecutive occurrences.” Theoretical Computer Science 927: 133–47. https://doi.org/10.1016/j.tcs.2022.06.004.

Bille, P. et al. (2022) ‘String indexing for top-k close consecutive occurrences’, Theoretical Computer Science, 927, pp. 133–147. Available at: https://doi.org/10.1016/j.tcs.2022.06.004.

@article{bille2022string,
  title = {{String indexing for top-k close consecutive occurrences}},
  author = {Bille, Philip and Gørtz, Inge Li and Pedersen, Max Rishøj and Rotenberg, Eva and Steiner, Teresa Anna},
  journal = {Theoretical Computer Science},
  volume = {927},
  pages = {133--147},
  year = {2022},
  doi = {10.1016/j.tcs.2022.06.004}
}