An efficient algorithm is presented for detecting approximate tandem repeats in genomic
sequences. The algorithm is based on a flexible statistical model which allows a wide range …

The book is intended for lectures on string processes and pattern matching in Master's
courses of computer science and software engineering curricula. The details of algorithms …

A repetition in a word w is a subword with the period of at most half of the subword length.
We study maximal repetitions occurring in w, that is those for which any extended subword …

Intended for graduate students and advanced undergraduates in computer science, A
Second Course in Formal Languages and Automata Theory treats topics in the theory of …

THE MYRIAD VIRTUES OF SUBWORD TREES Page 1 THE MYRIAD VIRTUES OF SUBWORD
TREES ALBERTO APOSTOLICO Department of Computer Science Purdue University West …

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 …

String searching is a subject of both theoretical and practical interest in computer science.
This book presents a bibliographic overview of the field and an anthology of detailed …

This paper discusses the current state of knowledge on musical pattern finding. Various
studies propose computational methods to find repeated musical patterns. Our detailed …

The time complexity of suffix tree construction has been shown to be equivalent to that of
sorting: O (n) for a constant-size alphabet or an integer alphabet and O (n log n) for a …

We present in this paper two algorithms. The first one extracts repeated motifs from a
sequence defined over an alphabet σ. For instance, σ may be equal to {A, C, G, T} and the …