Before revision:  However, since this result does not yield an efficient algorithm for the reconstruction, we  present new algorithms to compute a set of substring queries whose size grows as a function of other known measures of complexity, e.g., the number  rle of runs in S, the size g of the smallest grammar producing (only) S  or the size z_{no} of the non-overlapping LZ77 factorization of S.
After revision:  However, since this result does not yield an efficient algorithm for the reconstruction, we present new algorithms to compute a set of substring queries bounded by other known measures of complexity, e.g., the number  rle of runs in S, the size g of the smallest grammar producing (only) S or the size z_{no} of the non-overlapping LZ77 factorization of S.