scientific article; zbMATH DE number 1052825

MaRDI QIDQ4351065zbMATH OpenFDO

Authors W. F. Smyth, Larry Cummings

Publication date 4 February 1998

zbMATH Keywords

stringweak repetition

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Weak repetitions in Sturmian strings.
• An O(n log n) algorithm for finding all repetitions in a string
• Large-scale detection of repetitions
• scientific article; zbMATH DE number 3976360
• Fast and Practical Algorithms for Computing All the Runs in a String

Cited in

(15)

• Disjunctivity and other properties of sets of pseudo-bordered words
• Weak repetitions in Sturmian strings.
• An extension of the Lyndon-Schützenberger result to pseudoperiodic words
• Abelian powers and repetitions in Sturmian words
• Computing regularities in strings: a survey
• A characterization of the squares in a Fibonacci string
• Repetitive perhaps, but certainly not boring
• A note on easy and efficient computation of full abelian periods of a word
• \(k\)-abelian pattern matching
• Algorithms for computing abelian periods of words
• Fast computation of abelian runs
• Abelian repetitions in Sturmian words
• An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
• Repetition Detection in a Dynamic String
• Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings

This page was built for publication:

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