Skip to Content

1 Result Found

  • Article
  • Open Access
1 Citations
4,389 Views
33 Pages

Computing Maximal Lyndon Substrings of a String

  • Frantisek Franek and
  • Michael Liut

12 November 2020

There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maxima...

(This article belongs to the Special Issue Combinatorial Methods for String Processing)