Computing the cover array in linear time
From MaRDI portal
Publication:5956835
DOI10.1007/s00453-001-0062-2zbMath0995.68189OpenAlexW63662079MaRDI QIDQ5956835
Publication date: 23 October 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://researchrepository.murdoch.edu.au/id/eprint/27858/
Related Items
On left and right seeds of a string, Computing covers using prefix tables, Computing the \(\lambda \)-covers of a string, Two strings at Hamming distance 1 cannot be both quasiperiodic, Covering problems for partial words and for indeterminate strings, Efficient seed computation revisited, Enhanced string covering, Can we recover the cover?, Finding the cyclic covers of a string, String Covering: A Survey, The set of parameterized \(k\)-covers problem, Period recovery of strings over the Hamming and edit distances, Efficient algorithms for shortest partial seeds in words, Crochemore's partitioning on weighted strings and applications, Experimental evaluation of algorithms for computing quasiperiods, Efficient Computation of 2-Covers of a String., Fast algorithm for partial covers in words, Efficient Seeds Computation Revisited, ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS, String covering with optimal covers, Computing regularities in strings: a survey, IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS, New complexity results for the \(k\)-covers problem, Shortest covers of all cyclic shifts of a string, Optimality of some algorithms to detect quasiperiodicities, Generalized approximate regularities in strings, On approximate enhanced covers under Hamming distance, Universal reconstruction of a string, Quasi-Periodicity in Streams, A Linear-Time Algorithm for Seeds Computation, Approximate cover of strings, INFERRING STRINGS FROM COVER ARRAYS, Quasi-Periodicity Under Mismatch Errors, \(k\)-approximate quasiperiodicity under Hamming and edit distance
