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

Authors:
Zbigniew Adamczyk;Wojciech Rytter
Affiliations:
Copernicus University, Faculty of Mathematics and Informatics, Poland;Copernicus University, Faculty of Mathematics and Informatics, Poland and Institute of Informatics, Warsaw University, Poland
Venue:
Journal of Discrete Algorithms
Year:
2013

Citing 5
Cited 0

Two-way string-matching

Journal of the ACM (JACM)
String-matching on ordered alphabets

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
Text algorithms

Text algorithms
On maximal suffixes and constant-space linear-time versions of KMP algorithm

Theoretical Computer Science
Algorithms on Strings

Algorithms on Strings

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an alternative linear-time constant-space algorithm for computing maximal suffixes in strings, which is interesting due to its especially compact description. It also provides an exercise in proving nontrivial correctness of an algorithm having a concise description. The results are of a methodological character.