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

DOI10.1016/J.JDA.2013.03.002zbMATH Open1334.68308OpenAlexW1987950936MaRDI QIDQ396649FDOQ396649

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

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

zbMATH Keywords

algorithmlinear timemaximal suffixconstant space

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Two-way string-matching
• Factorizing words over an ordered alphabet
• Title not available (Why is that?)
• Algorithms on Strings
• String-matching on ordered alphabets
• On maximal suffixes and constant-space linear-time versions of KMP algorithm.
• Fast canonization of circular strings
• A fast equivalence-checking algorithm for circular lists

Cited In (2)

• Finding the maximum suffix with fewer comparisons
• Title not available (Why is that?)

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)