Finding the maximum suffix with fewer comparisons

DOI10.1007/978-3-642-13073-1_29zbMATH Open1284.68695OpenAlexW2157545003MaRDI QIDQ3563013FDOQ3563013

Authors: Gianni Franceschini, Torben Hagerup 

Publication date: 28 May 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13073-1_29

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

zbMATH Keywords

string algorithmscharacter comparisonsmaximum suffix

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited In (2)

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

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 Q3563013)