A note on a simple computation of the maximal suffix of a string

DOI10.1016/J.JDA.2013.03.002MaRDI QIDQ396649zbMATH OpenOpenAlexFDO

Authors Zbigniew Adamczyk, Wojciech Rytter

Publication date 13 August 2014

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

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

zbMATH Keywords

algorithmlinear timemaximal suffixconstant space

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• On maximal suffixes and constant-space linear-time versions of KMP algorithm.
• scientific article; zbMATH DE number 2086229
• On minimal and maximal suffixes of a substring
• Finding the maximum suffix with fewer comparisons
• Finding the maximum suffix with fewer comparisons

Cites work

• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• A fast equivalence-checking algorithm for circular lists
• Algorithms on Strings
• Factorizing words over an ordered alphabet
• Fast canonization of circular strings
• On maximal suffixes and constant-space linear-time versions of KMP algorithm.
• String-matching on ordered alphabets
• Two-way string-matching

Cited in

(3)

• Finding the maximum suffix with fewer comparisons
• scientific article; zbMATH DE number 2052916 (Why is no real title available?)
• Finding the maximum suffix with fewer comparisons

This page was built for publication: A note on a simple computation of the maximal suffix of a string

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