TA Steiner - arXiv preprint arXiv:2311.07415, 2023 - arxiv.org
In this paper, we consider the $ k $-approximate pattern matching problem under differential
privacy, where the goal is to report or count all substrings of a given string $ S $ which have …