Yoan José Pinzón Ardila

Linear time algorithm for the generalised longest common repeat problem

Given a set of strings

Necklace swap problem for rhythmic similarity measures

\mathcal{U} = \{T_{1}, T_{2}, . . . , T_{\ell}\}

NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES

, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of

Efficient algorithms for counting and reporting segregating sites in genomic sequences.

\mathcal{U}

Simple algorithm for sorting the fibonacci string rotations

, considering direct, inverted, mirror as well as everted repeats. In this paper we define the generalised longest common repeat problem, where we can set the number of times that a repeat should appear in each string. We present a linear time algorithm for this problem using the suffix array. We also show an application of our algorithm for finding a longest common substring which appears only in a subset

Approximation algorithm for the cyclic swap problem

\mathcal{U}^{\prime}

Efficient (delta,gamma)-Matching with Don't Cares

of

Efficient (δ, γ)-pattern-matching with don't cares

\mathcal{U}

Efficient (delta, gamma)-Pattern-Matching with Don't Cares

but not in

Wildcards in Delta-Matching

\mathcal{U}