Other parsing strategies that do not necessarily choose the longest prefix of
\(T[i,n]\)  are valid, in the sense that \(T\)  can be recovered from the
backward pointers. Those are called LZ-like
parses. Some examples are LZ-End [1]}, which forces sources to finish
at the end of a previous phrase, LZ77 with sliding window [2]}, which restricts the
sources to start in \(T[i-w,i-1]\)  for a fixed windows size \(w\) , and the bit-optimal
LZ [3]}, [4]}, where the phrases are chosen to minimize the encoding size
for a given encoder of pairs.
