Recommendations
Cites work
- Algorithms for computing the \(\lambda\)-regularities in strings
- An on-line string superprimitivity test
- An optimal algorithm to compute all the covers of a string
- Approximate seeds of strings
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Computing covers using prefix tables
- Computing the \(\lambda \)-covers of a string
- Computing the cover array in linear time
- Computing the λ-Seeds of a String
- Covering a string
- Efficient algorithms for shortest partial seeds in words
- Efficient detection of quasiperiodicities in strings
- Efficient randomized pattern-matching algorithms
- Efficient seed computation revisited
- Enhanced covers of regular and indeterminate strings using prefix tables
- Enhanced string covering
- Exact and Approximate Pattern Matching in the Streaming Model
- Fast algorithm for partial covers in words
- Fast Pattern Matching in Strings
- Frequency covers for strings
- scientific article; zbMATH DE number 7203330 (Why is no real title available?)
- New complexity results for the k-covers problem
- On approximate enhanced covers under Hamming distance
- On left and right seeds of a string
- Optimal superprimitivity testing for strings
- Periodicity in streams
- Quasi-periodicity under mismatch errors
- Quasiperiodicities in Fibonacci strings.
- Real-time streaming string-matching
- Streaming periodicity with mismatches
- String covering with optimal covers
- The complexity of the minimum k-cover problem
- Two strings at Hamming distance 1 cannot be both quasiperiodic
- Uniqueness Theorems for Periodic Functions
Cited in
(7)
This page was built for publication: Quasi-Periodicity in Streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088913)
