Quasi-Periodicity Under Mismatch Errors

DOI10.4230/LIPIcs.CPM.2018.4zbMath1497.68400OpenAlexW2804208109MaRDI QIDQ5140765

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

zbMATH Keywords

periodicitycoverquasi-periodicityapproximate cover

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (4)

String Covering: A Survey ⋮ Experimental evaluation of algorithms for computing quasiperiods ⋮ Quasi-Periodicity in Streams ⋮ \(k\)-approximate quasiperiodicity under Hamming and edit distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enhanced string covering
• 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 a string
• Two strings at Hamming distance 1 cannot be both quasiperiodic
• 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: Quasi-Periodicity Under Mismatch Errors