Detecting approximate periodic patterns

DOI10.1016/J.TCS.2013.05.001MaRDI QIDQ2437747zbMATH OpenOpenAlexFDO

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

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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• Detecting Approximate Periodic Patterns
• Finding longest approximate periodic patterns
• scientific article; zbMATH DE number 3960822
• scientific article; zbMATH DE number 4078831
• Finding patterns in given intervals
• Finding Patterns in Given Intervals
• DETECTION OF PERIODICITIES BY HIGHER-ORDER CROSSINGS

Cites work

• Finding longest approximate periodic patterns

Cited in

(6)

• On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms
• Detecting Approximate Periodic Patterns
• Approximate Periodicity
• String cadences
• Finding longest approximate periodic patterns
• scientific article; zbMATH DE number 1759538 (Why is no real title available?)

This page was built for publication: Detecting approximate periodic patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437747)