Quasi-periodicity under mismatch errors
From MaRDI portal
Publication:5140765
DOI10.4230/LIPICS.CPM.2018.4zbMATH Open1497.68400OpenAlexW2804208109MaRDI QIDQ5140765FDOQ5140765
Authors: Amihood Amir, Ely Porat, Avivit Levy 
Publication date: 16 December 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.CPM.2018.4
Recommendations
Cites Work
- Finding approximate repetitions under Hamming distance.
- Varieties of Regularities in Weighted Sequences
- Title not available (Why is that?)
- An on-line string superprimitivity test
- An optimal algorithm to compute all the covers of a string
- Enhanced string covering
- Computing the cover array in linear time
- Optimal superprimitivity testing for strings
- Covering a string
- Approximate Periodicity
- Efficient detection of quasiperiodicities in strings
- Repetitive perhaps, but certainly not boring
- Cover array string reconstruction
- Fast Algorithm for Partial Covers in Words
- Algorithms for computing the \(\lambda\)-regularities in strings
- Testing string superprimitivity in parallel
- Quasiperiodicity and string covering
- Approximate periods of strings
- Cycle detection and correction
- Approximate seeds of strings
- Two strings at Hamming distance 1 cannot be both quasiperiodic
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)
