Quasi-periodicity under mismatch errors
From MaRDI portal
Publication:5140765
Recommendations
Cites work
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- 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 Periodicity
- Approximate periods of strings
- Approximate seeds of strings
- Computing the cover array in linear time
- Cover array string reconstruction
- Covering a string
- Cycle detection and correction
- Efficient detection of quasiperiodicities in strings
- Enhanced string covering
- Fast Algorithm for Partial Covers in Words
- Finding approximate repetitions under Hamming distance.
- Optimal superprimitivity testing for strings
- Quasiperiodicity and string covering
- Repetitive perhaps, but certainly not boring
- Testing string superprimitivity in parallel
- Two strings at Hamming distance 1 cannot be both quasiperiodic
- Varieties of Regularities in Weighted Sequences
Cited in
(9)- String Covering: A Survey
- \(k\)-approximate quasiperiodicity under Hamming and edit distance
- Approximate cover of strings
- Can we recover the cover?
- Experimental evaluation of algorithms for computing quasiperiods
- Quasi-Periodicity in Streams
- Approximate cover of strings
- Density of \(k\)-ary words with 0, 1, 2-error overlaps
- Approximation and fixed parameter algorithms for the approximate cover problem
This page was built for publication: Quasi-periodicity under mismatch errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140765)
