A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
The longest Lyndon substring of a string T is the longest substring of T which is a Lyndon word. LLS(T ) denotes the length of the longest Lyndon substring of a string T . In this paper, we consider computing LLS(T ) where T is an edited string formed from T . After O(n) time and space preprocessing, our algorithm returns LLS(T ) in O(log n) time for any single character edit. We also consider a version of the problem with block edits, i.e., a substring of T is replaced by a given string ofdoi:10.4230/lipics.cpm.2018.19 dblp:conf/cpm/UrabeNIBT18 fatcat:rikiejsrnfegrn55jajxxab2pu