Jesper Jansson

Polynomial-time equivalences and refined algorithms for longest common subsequence variants

2024 · Discrete Applied Mathematics

The problem of computing the longest common subsequence of two sequences ( LCS for short) is a classical and fundamental problem in computer science. In this article, we study four variants of LCS : the …

Finding the cyclic covers of a string

2025 · Information Processing Letters

We introduce the concept of cyclic covers, which generalizes the classical notion of covers in strings. Given any string X , a factor W of X is called a cyclic cover if each position of …