the lcp array formula_18 only contains the length of the longest common prefix of every pair of consecutive suffixes in the suffix array formula_1. however, with the help of the inverse suffix array formula_117 (formula_118, i.e. the suffix formula_119 that starts at position formula_9 in formula_7 is stored in position formula_122 in formula_1) and constant-time range minimum queries on formula_18, it is possible to determine the length of the longest common prefix of arbitrary suffixes in formula_125 time.