Figure 1
From: Speeding up tandem mass spectrometry-based database searching by longest common prefix
An example of the corresponding suffix array and LCP for an input text string. The first row is the input text string T = T [0...n) = MSQVQVQV$. n is 8 and the index begins with 0. The second and third rows are the corresponding LCP and suffix array. Take the value at index 2 to explain the meaning. SA[2] is 6, which means that the third suffix in the ascending lexicographical order is the Suffix[6] and this suffix is "QV$". LCP[2] is 4, which means that the longest common prefix between the Suffix[2] "QVQVQV$" and its previous suffix (in the lexicographical order, Suffix[4]"QVQV$") is 4.