Can we recover the cover?
From MaRDI portal
Publication:2415365
DOI10.1007/S00453-019-00559-8zbMATH Open1423.68618OpenAlexW2752068024WikidataQ128166624 ScholiaQ128166624MaRDI QIDQ2415365FDOQ2415365
Authors: Amihood Amir, Avivit Levy, Moshe Lewenstein, R. Lubin, Benny Porat 
Publication date: 21 May 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-019-00559-8
Recommendations
Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Algorithms on strings (68W32)
Cites Work
- Finding approximate repetitions under Hamming distance.
- Varieties of Regularities in Weighted Sequences
- Title not available (Why is that?)
- Fast Pattern Matching in Strings
- Generalized String Matching
- 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
- 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
- A linear time algorithm for shortest cyclic cover of strings
- Cycle detection and correction
- Period recovery over the Hamming and edit distances
- Approximate seeds of strings
- String covering with optimal covers
Cited In (16)
- Title not available (Why is that?)
- String Covering: A Survey
- Quasi-periodicity under mismatch errors
- Efficient Computation of 2-Covers of a String.
- \(k\)-approximate quasiperiodicity under Hamming and edit distance
- Approximate cover of strings
- Title not available (Why is that?)
- On suffix tree detection
- Multidimensional period recovery
- Cycle detection and correction
- Experimental evaluation of algorithms for computing quasiperiods
- Cycle detection and correction
- Approximate cover of strings
- Entropy Based Approach to Data Loss Reparation Through the Indeterminate Fine-Grained Parallel Computation
- Approximation and fixed parameter algorithms for the approximate cover problem
- On suffix tree detection
This page was built for publication: Can we recover the cover?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2415365)
