A note on a simple computation of the maximal suffix of a string
2013
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.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
9
References
1
Citations
NaN
KQI