Approximate Circular Pattern Matching under Edit Distance

Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski +3

In the $k$-Edit Circular Pattern Matching ($k$-Edit CPM) problem, we are given a length-$n$ text $T$, a length-$m$ pattern $P$, and a positive integer threshold $k$, and we are to…