Overview of the PFP workflow. (1) PFP takes as input a text T and two integer parameters, the window size w and the hash modulus p. In the example, w = 2 and p ∈ Z⁺, where Z⁺ represents the set of positive integers. (2) It internally prepends the $ symbol and appends w consecutive copies of # to T. (3) The modified text is parsed by sliding a window of length w across the text; when a trigger string is encountered (highlighted in green), the current phrase terminates and the next phrase begins. During parsing, the dictionary $D_T$ and parse $P_T$ are constructed, with $D_T$ initially unsorted and $P_T$ containing temporary phrase records (*). (4) Finally, $D_T$ is sorted and the records in $P_T$ are replaced by the ranks of the corresponding dictionary phrases; the dotted box shows the multiset S of suffixes longer than w derived from phrases in $D_T$.