Efficient Compressed Representation of Repetitive Texts with Direct Access

Generalized Straight-Line Programs (GSLPs) can be balanced to have height O(log n) without asymptotically increasing their size. Iterated SLPs (ISLPs), a specialized form of GSLPs, can represent some text families in size o(δ) while supporting efficient substring extraction and other queries.