CROCHEMORE'S REPETITIONS ALGORITHM REVISITED: COMPUTING RUNS

DOI10.1142/S0129054112400199zbMath1246.68275MaRDI QIDQ2909203

Mei Jiang, Frantisek Franek

Publication date: 30 August 2012

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

periodicityrepetitionstringsuffix arraysuffix treerunCrochemore's algorithm

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Cites Work

• Replacing suffix trees with enhanced suffix arrays
• Maximal repetitions in strings
• A characterization of the squares in a Fibonacci string
• Suffix Arrays: A New Method for On-Line String Searches

This page was built for publication: CROCHEMORE'S REPETITIONS ALGORITHM REVISITED: COMPUTING RUNS