On the complexity of computing the order of repetition of a string

MaRDI QIDQ2708962zbMATH OpenFDO

Authors Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter

Publication date 26 June 2003

zbMATH Keywords

complexity of computing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Parallel algorithms in computer science (68W10)

Recommendations

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

Cited in

(7)

• An O(n log n) algorithm for finding all repetitions in a string
• A coarse-grained multicomputer algorithm for the detection of repetitions
• scientific article; zbMATH DE number 1615297 (Why is no real title available?)
• On the Cost of Interchange Rearrangement in Strings
• The complexity of searching a sorted array of strings
• scientific article; zbMATH DE number 3976360 (Why is no real title available?)
• scientific article; zbMATH DE number 1751384 (Why is no real title available?)

This page was built for publication: On the complexity of computing the order of repetition of a string

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