Abstract: We say a string has a cadence if a certain character is repeated at regular intervals, possibly with intervening occurrences of that character. We call the cadence anchored if the first interval must be the same length as the others. We give a sub-quadratic algorithm for determining whether a string has any cadence consisting of at least three occurrences of a character, and a nearly linear algorithm for finding all anchored cadences.
Recommendations
Cites work
- scientific article; zbMATH DE number 3118808 (Why is no real title available?)
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 799788 (Why is no real title available?)
- scientific article; zbMATH DE number 918133 (Why is no real title available?)
- scientific article; zbMATH DE number 3062467 (Why is no real title available?)
- Avoidable patterns in strings of symbols
- Detecting approximate periodic patterns
- Efficient algorithms for the periodic subgraphs mining problem
- Finding longest approximate periodic patterns
- Introduction to algorithms
Cited in
(3)
This page was built for publication: String cadences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1676299)