Figure 3
From: Speeding up tandem mass spectrometry-based database searching by longest common prefix
An example of the algorithm GetAllSubStrings. The original string T is {MSQVQVQV$}, and the LCP is {0, 0, 4, 3, 2, 1, 0, 0, 0}. Because the '$' does not belong to the protein sequence database, so the '$' is omitted from in the For loop. Take the suffix "VQVQV" as an example. The corresponding LCP is 3 and this suffix generates substrings at length from 4 (LCP plus one), so this suffix generates two substrings "VQVQ" and "VQVQV".