A Correction to "An Optimal Algorithm to Compute all the Covers of a String"

@article{Moore1995ACT,
  title={A Correction to "An Optimal Algorithm to Compute all the Covers of a String"},
  author={Dennis W. G. Moore and William F. Smyth},
  journal={Inf. Process. Lett.},
  year={1995},
  volume={54},
  pages={101-103}
}
An Optimal On-Line Algorithm To Compute All The Covers Of A String
TLDR
This paper extends the work of Moore and Smyth on computing the covers of a string: the algorithm computes all the cover of every preex of x in time (n).
Computing the lambda-covers of a string
Shortest Covers of All Cyclic Shifts of a String
TLDR
An O ( n log n )-time algorithm that computes the shortest cover of every cyclic shift of a string and an O-time algorithms that compute the shortest among these covers are shown.
Computing the Minimum Approximate lambda-Cover of a String
TLDR
This paper presents an algorithm that can solve the minimum approximate λ-cover problem of a string in polynomial time, under a variety of distance models including the Hamming distance, the edit distance and the weighted edit distance.
New and Efficient Approaches to the Quasiperiodic Characterisation of a String
TLDR
New, simple, easily-computed, and widely applicable notions of string covering that provide an intuitive and useful characterisation of a string and its prefixes are proposed: the enhanced cover and theEnhanced cover array.
Efficient Computation of 2-Covers of a String
TLDR
A natural extension of cover is considered, which can be generalized to λ > 2 equal-length strings, resulting in the notion of λ-cover, and an algorithm is given that computes all 2-covers of a string of length n in O(n logn log logn+ output) expected time or O( n logn logn2 logn/ log logLogn+output) worst-case time, where output is the size of output.
Shortest Covers of All Cyclic Shifts of a String
TLDR
An \(\mathcal {O}(n \log n)\)-time algorithm that computes the shortest cover of every cyclic shift of a string and an \(\mathCal {O)(n) time algorithm thatCompute the shortest among these covers.
Computing the Cover Array in Linear Time
TLDR
This paper introduces an array γ = γ[1..n] called the cover array in which each element γ, 1 ≤ i ≤ n, is the length of the longest proper cover of x[1…i] or zero if no such cover exists.
...
...