scientific article; zbMATH DE number 2051171

zbMATH Open1040.68079MaRDI QIDQ4453462FDOQ4453462

Authors: Igor Potapov, Leszek Gąsieniec, Roman Kolpakov 

Publication date: 7 March 2004

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

unbounded alphabet

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• Space efficient search for maximal repetitions
• Faster algorithms for computing maximal multirepeats in multiple sequences
• Online detection of repetitions with backtracking
• Almost linear time computation of maximal repetitions in run length encoded strings
• Fast algorithms for finding a minimum repetition representation of strings and trees
• On maximal repeats in strings
• An O(n log n) algorithm for finding all repetitions in a string

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)