String covering with optimal covers
From MaRDI portal
Recommendations
Cites work
- An on-line string superprimitivity test
- An optimal algorithm to compute all the covers of a string
- Computing the cover array in linear time
- Efficient detection of quasiperiodicities in strings
- Enhanced covers of regular and indeterminate strings using prefix tables
- Enhanced string covering
- Fast algorithm for partial covers in words
- Fast, practical algorithms for computing all the repeats in a string
- Frequency covers for strings
- Introduction to algorithms.
- Optimal superprimitivity testing for strings
- The ``runs theorem
- The complexity of the minimum \(k\)-cover problem
Cited in
(7)
This page was built for publication: String covering with optimal covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1757464)