We consider the question of finding an approximate period in a given string S of length n. Let
S′ be a periodic string closest to S under some distance metric. We consider this distance …

The Arithmetic Progressions Tree (APT) is an encoding of a monotonic sequence ℒ in [1.. n].
Previous work on APT coding focused on its theoretical and experimental compression …

A problem that has been gaining importance in recent years is that of computing the Abelian
periods in a string. A string w has an Abelian period p if it is a sequence of permutations of a …

Periodicity has been historically well studied and has numerous applications. In nature,
however, few cyclic phenomena have an exact period. This paper surveys some recent …

Finding an approximate period in a given string S of length n is defined as follows. Let S′
be a periodic string closest to S under some distance metric, find the smallest period of S …

This thesis is concerned with the study of problems related to the measurement of disorder
in the data stream model where the input, accessed in sequential manner, is a long …