FIX to Stronger Lempel-Ziv Based Compressed Text Indexing

Lemma 1 [28] actually states that n log n <= u Hk + ..., not the equality. We use the equality along the paper as an upper bound.