Tatiana Starikovskaya

The k-mismatch problem revisited

2015 · arXiv (Cornell University)

We revisit the complexity of one of the most basic problems in pattern matching. In the k-mismatch problem we must compute the Hamming distance between a pattern of length m and every m-length substring of …

Periodicity Property Testing on Strings with Wildcards

2026 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

In this work, we study periodicity in strings with wildcards. A string T with at most k wildcards is called strongly (p,k)-periodic if the wildcards in T can be replaced with alphabet symbols to obtain …