|
|
|
|
|
Frantisek Franek and Michael Liut
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-maximal Ly...
ver más
|
|
|
|
|