A note on a simple computation of the maximal suffix of a string
From MaRDI portal
Publication:396649
DOI10.1016/j.jda.2013.03.002zbMath1334.68308OpenAlexW1987950936MaRDI QIDQ396649
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
Cites Work
- Unnamed Item
- String-matching on ordered alphabets
- A fast equivalence-checking algorithm for circular lists
- On maximal suffixes and constant-space linear-time versions of KMP algorithm.
- Factorizing words over an ordered alphabet
- Fast canonization of circular strings
- Two-way string-matching
- Algorithms on Strings