Finding the maximum suffix with fewer comparisons

DOI10.1016/J.JDA.2011.03.008MaRDI QIDQ635741zbMATH OpenOpenAlexFDO

Authors 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

character comparisonsmaximum suffixstring algorithms

Mathematics Subject Classification ID

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

Recommendations

• Finding the maximum suffix with fewer comparisons
• On minimal and maximal suffixes of a substring
• A note on a simple computation of the maximal suffix of a string
• Faster suffix sorting
• Computing minimal and maximal suffixes of a substring

Cites work

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

Cited in

(2)

• Finding the maximum suffix with fewer comparisons
• A note on a simple computation of the maximal suffix of a string

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

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