Before revision:  We first show that any string of length n over an integer alphabet of size \sigma with  rle runs can be reconstructed with q=O(  rle (\sigma + \log \frac{n{{\sf rle}}}  )) substring queries in linear time and space.
After revision:  We first show that any string of length n over an integer alphabet of size \sigma with  rle runs can be reconstructed with q=O(  rle (\sigma + \log \frac{n{{\sf rle}}} \frac{n )) substring queries in linear time and space.