Detecting approximate periodic patterns

DOI10.1016/J.TCS.2013.05.001zbMath1282.68199OpenAlexW1968735844MaRDI QIDQ2437747

Alberto Apostolico, Estrella Eisenberg, Amihood Amir, Avivit Levy, Noa Lewenstein, Gad M. Landau

Publication date: 13 March 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.001

zbMATH Keywords

string analysisapproximate arithmetic progressionsapproximate periodic patterns

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics on words (68R15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)

Related Items (1)

String cadences

Cites Work

• Finding Longest Approximate Periodic Patterns

This page was built for publication: Detecting approximate periodic patterns