AbstractA string z is quasiperiodic if there is a second string w ≠ z such that the occurrences of w in z cover z entirely, i.e., every position of z falls within some occurrence of w in z. It is shown here that all maximal quasiperiodic substrings of a string x of n symbols can be detected in time O(n log2 n)
In this paper, we study local maximal antiperiodicities. Given a string X and an integer k, we compu...
A word is quasiperiodic if it can be obtained by concatenations and overlaps of a smaller word, call...
AbstractThe aim of this survey is to provide insight into the sequential algorithms that have been p...
AbstractA string z is quasiperiodic if there is a second string w ≠ z such that the occurrences of w...
Apostolico and Ehrenfeucht defined the notion of a maximal quasiperiodicsubstring and gave an algori...
Abstract Apostolico and Ehrenfeucht defined the notion of a maximal quasiperiodic substring and gave...
The study of repetitions in words constitutes an important stream of research both in combina-torics...
AbstractHere we consider the problem of computing normal forms of quasiperiodic strings. A string x ...
A quasiperiod of a finite or infinite string is a word whose occurrences cover every part of the str...
Abstract The concept of quasiperiodicity is a generalization of the notion of periodicity where in c...
AbstractIn this paper, we study word regularities and in particular extensions of the notion of the ...
Abstract. A factor u of a string y is a cover of y if every letter of y lies within some occurrence ...
We study a central problem of string processing: the compact representation of a string by its frequ...
Let be a finite alphabet. A word w over is said to be quasiperiodic if it has a finite proper subw...
We provide an exact estimate on the maximal subword complexity for quasiperiodic infinite words. To ...
In this paper, we study local maximal antiperiodicities. Given a string X and an integer k, we compu...
A word is quasiperiodic if it can be obtained by concatenations and overlaps of a smaller word, call...
AbstractThe aim of this survey is to provide insight into the sequential algorithms that have been p...
AbstractA string z is quasiperiodic if there is a second string w ≠ z such that the occurrences of w...
Apostolico and Ehrenfeucht defined the notion of a maximal quasiperiodicsubstring and gave an algori...
Abstract Apostolico and Ehrenfeucht defined the notion of a maximal quasiperiodic substring and gave...
The study of repetitions in words constitutes an important stream of research both in combina-torics...
AbstractHere we consider the problem of computing normal forms of quasiperiodic strings. A string x ...
A quasiperiod of a finite or infinite string is a word whose occurrences cover every part of the str...
Abstract The concept of quasiperiodicity is a generalization of the notion of periodicity where in c...
AbstractIn this paper, we study word regularities and in particular extensions of the notion of the ...
Abstract. A factor u of a string y is a cover of y if every letter of y lies within some occurrence ...
We study a central problem of string processing: the compact representation of a string by its frequ...
Let be a finite alphabet. A word w over is said to be quasiperiodic if it has a finite proper subw...
We provide an exact estimate on the maximal subword complexity for quasiperiodic infinite words. To ...
In this paper, we study local maximal antiperiodicities. Given a string X and an integer k, we compu...
A word is quasiperiodic if it can be obtained by concatenations and overlaps of a smaller word, call...
AbstractThe aim of this survey is to provide insight into the sequential algorithms that have been p...
DOI
Add to ORKG