Approximate cover of strings
From MaRDI portal
Publication:2326399
DOI10.1016/j.tcs.2019.05.020zbMath1423.68362OpenAlexW2947124550WikidataQ127800842 ScholiaQ127800842MaRDI QIDQ2326399
R. Lubin, Avivit Levy, Amihood Amir, Ely Porat
Publication date: 7 October 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7318/
Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Multidimensional period recovery ⋮ Finding the cyclic covers of a string ⋮ String Covering: A Survey ⋮ Experimental evaluation of algorithms for computing quasiperiods ⋮ Efficient Computation of 2-Covers of a String. ⋮ \(k\)-approximate quasiperiodicity under Hamming and edit distance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enhanced string covering
- Fast algorithm for partial covers in words
- Efficient detection of quasiperiodicities in strings
- Optimal superprimitivity testing for strings
- An on-line string superprimitivity test
- Quasiperiodicity and string covering
- Testing string superprimitivity in parallel
- An optimal algorithm to compute all the covers of a string
- Finding approximate repetitions under Hamming distance.
- Repetitive perhaps, but certainly not boring
- Covering problems for partial words and for indeterminate strings
- Efficient algorithms for shortest partial seeds in words
- Covering a string
- Two strings at Hamming distance 1 cannot be both quasiperiodic
- Can we recover the cover?
- Cycle detection and correction
- Approximate Periodicity
- Cover Array String Reconstruction
- Varieties of Regularities in Weighted Sequences
- Fast Algorithm for Partial Covers in Words
- Computing the cover array in linear time
- Approximate periods of strings
This page was built for publication: Approximate cover of strings
