Finding the maximum suffix with fewer comparisons

DOI10.1016/J.JDA.2011.03.008zbMath1234.68474OpenAlexW2156862647MaRDI QIDQ635741

Gianni Franceschini, Torben Hagerup

Publication date: 23 August 2011

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.03.008

zbMATH Keywords

string algorithmscharacter comparisonsmaximum suffix

Mathematics Subject Classification ID

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

Cites Work

• Factorizing words over an ordered alphabet
• Fast canonization of circular strings

This page was built for publication: Finding the maximum suffix with fewer comparisons