Enhanced string covering
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2052918 (Why is no real title available?)
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- A work-time optimal algorithm for computing all string covers
- Algorithms on Strings
- An on-line string superprimitivity test
- An optimal algorithm to compute all the covers of a string
- Computing regularities in strings: a survey
- Computing the cover array in linear time
- Efficient detection of quasiperiodicities in strings
- Efficient seeds computation revisited
- Fast Pattern Matching in Strings
- New complexity results for the \(k\)-covers problem
- On the right-seed array of a string
- Optimal superprimitivity testing for strings
- The complexity of the minimum \(k\)-cover problem
Cited in
(20)- Approximate cover of strings
- Fast algorithm for partial covers in words
- Verifying an enhanced cover array in linear time
- Efficient Computation of 2-Covers of a String.
- Enhanced covers of regular and indeterminate strings using prefix tables
- \(k\)-approximate quasiperiodicity under Hamming and edit distance
- Approximation and fixed parameter algorithms for the approximate cover problem
- String Covering: A Survey
- String covering with optimal covers
- Crochemore's partitioning on weighted strings and applications
- Quasi-Periodicity in Streams
- Computing covers using prefix tables
- Quasi-periodicity under mismatch errors
- Subsequence covers of words
- An on-line string superprimitivity test
- On approximate enhanced covers under Hamming distance
- Experimental evaluation of algorithms for computing quasiperiods
- Efficient algorithms for shortest partial seeds in words
- Can we recover the cover?
- Linear-time computation of prefix table for weighted strings {\&} applications
This page was built for publication: Enhanced string covering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393116)
