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 application/pdf
.
Minimal Suffix and Rotation of a Substring in Optimal Time
2016
Annual Symposium on Combinatorial Pattern Matching
For a text of length n given in advance, the substring minimal suffix queries ask to determine the lexicographically minimal non-empty suffix of a substring specified by the location of its occurrence in the text. We develop a data structure answering such queries optimally: in constant time after linear-time preprocessing. This improves upon the results of Babenko et al. (CPM 2014), whose trade-off solution is characterized by Θ(n log n) product of these time complexities. Next, we extend our
doi:10.4230/lipics.cpm.2016.28
dblp:conf/cpm/Kociumaka16
fatcat:5ecfttqb4rcqraxd6ezwipepxq