Resumen
We present algorithms computing the non-overlapping Lempel?Ziv-77 factorization and the longest previous non-overlapping factor table within small space in linear or near-linear time with the help of modern suffix tree representations fitting into limited space. With similar techniques, we show how to answer substring compression queries for the Lempel?Ziv-78 factorization with a possible logarithmic multiplicative slowdown depending on the used suffix tree representation.