In the k-mappability problem, we are given a string x of length n and integers m and k, and we are asked to count, for each length-m factor y of x, the number of other factors of length m of x thatâ€¦ (More)

In the Range Minimum Query (RMQ) problem, we are given an array A of n numbers and we are asked to answer queries of the following type: for indices i and j between 0 and nâˆ’ 1, query RMQ A (i, j)â€¦ (More)

Identifying palindromes in sequences has been an interesting line of research in combinatorics on words and also in computational biology, after the discovery of the relation of palindromes in theâ€¦ (More)

We introduce the Longest Common Circular Factor (LCCF) problem in which, given strings S and T of length n, we are to compute the longest factor of S whose cyclic shift occurs as a factor of T . Itâ€¦ (More)

In this work, we consider a special type of uncertain sequence called weighted string. In a weighted string every position contains a subset of the alphabet and every letter of the alphabet isâ€¦ (More)

A generalised degenerate string (GD string) Åœ is a sequence of n sets of strings of total size N , where the ith set contains strings of the same length ki but this length can vary between differentâ€¦ (More)