Key points are not available for this paper at this time.
A linear implementation of the optimal universal data compression methods of Lempel and Ziv is described. The main tool is McCreight's algorithm for constructing suffix trees. Both bounded and unbounded memory are considered.
Rodeh et al. (Thu,) studied this question.