The Lempel-Ziv-77 algorithm greedily factorizes a text into maximal substrings that have previous occurrences, which is particularly useful for text compression. In this lecture, we show how to compute this factorization in linear time using suffix trees.