In previous approaches to repetition discovery in music, the music to be analysed has been
represented using strings. However, there are certain types of interesting musical repetitions …

A string w covers another string z if every symbol of z is within some occurrence of w in z. A
string is called superprimitive if it is covered only by itself, and quasiperiodic if it is covered …

What kind of operations can we perform effectively (without full unpacking) with compressed
texts? In this paper we consider three fundamental problems:(1) check the equality of two …

We consider the problem of finding the repetitive structures of a given string x. The period u
of the string x grasps the repetitiveness of x, since x is a prefix of a string constructed by …

Let x denote a given nonempty string of length n=| x|. A proper substring u of x is a proper
cover of x if and only if every position of x lies within an occurrence of u within x. This paper …

Let x denote a given nonempty string of length n=| x|⩾ 1. A string u is a cover of x if and only
if every position of x lies within an occurrence of u within x. Thus x is always a cover of itself …

Quasiperiodic strings were defined by Apostolico and Ehrenfeucht [3], as strings which are
entirly covered by occurrences of another (shorter) string. This paper surveys a handful of …

Internationally recognised researchers look at developing trends in combinatorics with
applications in the study of words and in symbolic dynamics. They explain the important …

The problem of the set of k-covers is a distance measure for strings. Another well-studied
string comparison measure is that of parameterized matching. We consider the problem of …

In this paper we present the first set of approximation and inapproximability results for the
Exemplar Breakpoint Distance Problem. Our inapproximability results hold for the simplest …