Motivations This work is motivated by previous works on LZ-indices  Space-efficient construction of LZ-index [AN, ISAAC'05]  Very preliminary representation:  nlog n bits for pointers, child operation and insertions in O(k) worst-case time  LZ-index on disk [AN, CPM'07]  Basic operations in O(1) CPU time, yet  nlog n bits are needed for pointers and does not support insertions nor deletions
{}