Crochemore's repetitions algorithm revisited: computing runs

DOI10.1142/S0129054112400199MaRDI QIDQ2909203zbMATH OpenFDO

Authors Frantisek Franek, Mei Jiang

Publication date 30 August 2012

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

Full work available at URL https://doi.org/10.1142/S0129054112400199

zbMATH Keywords

Crochemore's algorithmperiodicityrepetitionrunstringsuffix arraysuffix tree

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2052916
• scientific article; zbMATH DE number 1189326
• Fast computation of abelian runs
• Towards a Solution to the “Runs” Conjecture
• Almost linear time computation of maximal repetitions in run length encoded strings
• Fast and Practical Algorithms for Computing All the Runs in a String
• Recursive versions Of the algorithm by krasker and welsch

Cites work

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

Cited in

(1)

• scientific article; zbMATH DE number 2052916 (Why is no real title available?)

This page was built for publication: Crochemore's repetitions algorithm revisited: computing runs

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