FIX to Practical Compressed Suffix Trees

Level: Small

In Sections 7.1 and 7.3 it is said that RePair compresses the LCP array to O(r log(n/r)) words. This is inherited from previous publications, where it is not properly proved, and most likely to be incorrect; see Appendix A in An alternative grammar compressor achieving this space is given in that arxiv paper.