 R-index Gagie et al., ACM'20%DIFDELCMD < ] %%% is an efficient compressed index on RLBWTwhose space usage depends not on string length but the number of runs in an RLBWT, and it supports locate queries in an optimal time with \omega are two key functions for building indexes on RLBWT, and the best previous result computes LF and \phi^{-1} in O(\log \log n) time with O} (r) words for the number r of runs in the RLBWTof an input string.
<clarity>  R-index Gagie et al., ACM'20%DIFDELCMD < ] %%% is an efficient compressed index on RLBWTwhose space usage depends not on string length but the number of runs in an RLBWT, and it supports locate queries in an optimal time with \omega are two key functions for building indexes on RLBWT, and the best previous result computes LF and \phi^{-1} in O(\log \log n) time with O} (r) words for the number r of runs in the RLBWTof an input string.
 R-index Gagie et al., ACM'20%DIFDELCMD < ] %%% received interest for indexing highly repetitive strings. LF and \phi^{-1 are two key functions for building indexes on RLBWT, and the best previous result computes LF and \phi^{-1} in O(\log \log n) time with O} (r) words for the number r of runs in the RLBWTof an input string.