### ?

## Computing Minimal and Maximal Suffixes of a Substring Revisited

We revisit the problems of computing the maximal and the minimal non-empty suffixes of a substring of a longer text of length *n*, introduced by Babenko, Kolesnichenko and Starikovskaya [CPM’13]. For the minimal suffix problem we show that for any 1 ≤ *τ* ≤ log*n* there exists a linear-space data structure with*k* is the number of distinct factors in the decomposition. For the maximal suffix problem we give a linear-space structure with