scientific article; zbMATH DE number 2051171

MaRDI QIDQ4453462zbMATH OpenFDO

Authors Igor Potapov, Leszek Gąsieniec, Roman Kolpakov

Publication date 7 March 2004

zbMATH Keywords

unbounded alphabet

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Space efficient search for maximal repetitions
• Understanding maximal repetitions in strings
• Maximal repetitions in strings
• Fast and Practical Algorithms for Computing All the Runs in a String
• Almost linear time computation of maximal repetitions in run length encoded strings

Cited in

(8)

• Space efficient search for maximal repetitions
• On maximal repeats in strings
• scientific article; zbMATH DE number 2052916 (Why is no real title available?)
• Fast algorithms for finding a minimum repetition representation of strings and trees
• An O(n log n) algorithm for finding all repetitions in a string
• Online detection of repetitions with backtracking
• Faster algorithms for computing maximal multirepeats in multiple sequences
• Almost linear time computation of maximal repetitions in 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 Q4453462)