Before revision:  In this paper, we present the first such enumeration algorithms with space usage not proportional to the string length. The complexities of our enumeration algorithms are O(n \log \log (n/r)) time and  O(r ) words of working space for string length n and RLBWT size r .
After revision:  In this paper, we present r-enum (RLBWT-based enumeration), the first enumeration algorithm for characteristic substrings based on RLBWT. R-enum runs in O(n \log \log (n/r)) time and O(r ) words of working space for string length n and RLBWT size r .