Computing the cover array in linear time
From MaRDI portal
Recommendations
Cited in
(45)- An optimal algorithm to compute all the covers of a string
- 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
- String covering with optimal covers
- Computing regularities in strings: a survey
- k-approximate quasiperiodicity under Hamming and edit distance
- Experimental evaluation of algorithms for computing quasiperiods
- On approximate enhanced covers under Hamming distance
- Universal reconstruction of a string
- Approximate cover of strings
- On left and right seeds of a string
- Computing the \(\lambda \)-covers of a string
- Two strings at Hamming distance 1 cannot be both quasiperiodic
- Can we recover the cover?
- Inferring strings from cover arrays
- Linear time inference of strings from cover arrays using a binary alphabet (extended abstract)
- Efficient seeds computation revisited
- scientific article; zbMATH DE number 1003283 (Why is no real title available?)
- Computing covers using prefix tables
- Cover array string reconstruction
- Efficient seed computation revisited
- Enhanced string covering
- The set of parameterized k-covers problem
- Identifying all abelian periods of a string in quadratic time and relevant problems
- Fast algorithm for partial covers in words
- Quasi-Periodicity in Streams
- Quasi-periodicity under mismatch errors
- Computing palindromic factorizations and palindromic covers on-line
- Verifying an enhanced cover array in linear time
- Enhanced covers of regular and indeterminate strings using prefix tables
- Generalized approximate regularities in strings
- New complexity results for the k-covers problem
- ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS
- Efficient Computation of 2-Covers of a String.
- Shortest covers of all cyclic shifts of a string
- Finding the cyclic covers of a string
- String Covering: A Survey
- Computing Covers Under Substring Consistent Equivalence Relations
- Approximation and fixed parameter algorithms for the approximate cover problem
- Internal quasiperiod queries
- Finding the cyclic covers of a string
- String 2-covers with no length restrictions
- Covers in optimal space
- Optimality of some algorithms to detect quasiperiodicities
This page was built for publication: Computing the cover array in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956835)
