Generalized approximate regularities in strings
From MaRDI portal
Recommendations
Cites work
- A work-time optimal algorithm for computing all string covers
- An on-line string superprimitivity test
- An optimal algorithm for computing the repetitions in a word
- Approximate periods of strings
- Approximate seeds of strings
- Computing the \(\lambda \)-covers of a string
- Computing the cover array in linear time
- Computing the λ-Seeds of a String
- Covering a string
- scientific article; zbMATH DE number 1615270 (Why is no real title available?)
- Optimal off-line detection of repetitions in a string
- Optimal superprimitivity testing for strings
- The subtree max gap problem with application to parallel string covering
Cited in
(11)- An umbral relation between pattern and commutation in strings
- Approximate cover of strings
- scientific article; zbMATH DE number 1615296 (Why is no real title available?)
- scientific article; zbMATH DE number 6003273 (Why is no real title available?)
- The set of parameterized k-covers problem
- scientific article; zbMATH DE number 1092948 (Why is no real title available?)
- scientific article; zbMATH DE number 6868589 (Why is no real title available?)
- Approximate cover of strings
- Approximate seeds of strings
- Algorithms for computing the \(\lambda\)-regularities in strings
- Implementing approximate regularities
This page was built for publication: Generalized approximate regularities in strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451457)