Let α and β be a partition of {1, . . . , n} into two blocks. A merging network is a network of comparators which allows as input arbitrary real numbers and has the property tha...
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...