Optimal square detection over general alphabets
Squares (fragments of the form xx, for some string x) are arguably the most natural type of
repetition in strings. The basic algorithmic question concerning squares is to check if a given …
repetition in strings. The basic algorithmic question concerning squares is to check if a given …
[图书][B] 125 Problems in Text Algorithms: With Solutions
String matching is one of the oldest algorithmic techniques, yet still one of the most
pervasive in computer science. The past 20 years have seen technological leaps in …
pervasive in computer science. The past 20 years have seen technological leaps in …
On the number of squares in a finite word
S Brlek, S Li - arXiv preprint arXiv:2204.10204, 2022 - arxiv.org
A {\em square} is a word of the form $ uu $. In this paper we prove that for a given finite word
$ w $, the number of distinct square factors of $ w $ is bounded by $| w|-|\Alphabet (w)|+ 1 …
$ w $, the number of distinct square factors of $ w $ is bounded by $| w|-|\Alphabet (w)|+ 1 …
On the number of distinct squares in finite sequences: Some old and new results
S Brlek, S Li - International Conference on Combinatorics on Words, 2023 - Springer
A square is a word of the form uu, where u is a finite word. The problem of determining the
number of distinct squares in a finite word was initially explored by Fraenkel and Simpson in …
number of distinct squares in a finite word was initially explored by Fraenkel and Simpson in …
Computing all distinct squares in linear time for integer alphabets
Given a string on an integer alphabet, we present an algorithm that computes the set of all
distinct squares belonging to this string in time linear to the string length. As an application …
distinct squares belonging to this string in time linear to the string length. As an application …
The number of repetitions in 2D-strings
The notions of periodicity and repetitions in strings, and hence these of runs and squares,
naturally extend to two-dimensional strings. We consider two types of repetitions in 2D …
naturally extend to two-dimensional strings. We consider two types of repetitions in 2D …
[HTML][HTML] Period recovery of strings over the Hamming and edit distances
A string T of length m is periodic in P of length p if P is a substring of T and T [i]= T [i+ p] for all
0≤ i≤ m− p− 1 and m≥ 2 p. The shortest such prefix, P, is called the period of T (ie, P= T …
0≤ i≤ m− p− 1 and m≥ 2 p. The shortest such prefix, P, is called the period of T (ie, P= T …
Counting distinct patterns in internal dictionary matching
P Charalampopoulos, T Kociumaka… - arXiv preprint arXiv …, 2020 - arxiv.org
We consider the problem of preprocessing a text $ T $ of length $ n $ and a dictionary
$\mathcal {D} $ in order to be able to efficiently answer queries $ CountDistinct (i, j) $, that is …
$\mathcal {D} $ in order to be able to efficiently answer queries $ CountDistinct (i, j) $, that is …
Lower bounds for the number of repetitions in 2D strings
P Gawrychowski, S Ghazawi, GM Landau - String Processing and …, 2021 - Springer
A 2D string is simply a 2D array. We continue the study of the combinatorial properties of
repetitions in such strings over the binary alphabet, namely the number of distinct tandems …
repetitions in such strings over the binary alphabet, namely the number of distinct tandems …