Enumeration of LCP values, LCP intervals and Maximal repeats in BWT-runs Bounded Space
share
Lcp-values, lcp-intervals, and maximal repeats are powerful tools in various string processing tasks and have a wide variety of applications. Although many researchers have focused on developing enumeration algorithms for them, those algorithms are inefficient in that the space usage is proportional to the length of the input string. Recently, the run-length-encoded Burrows-Wheeler transform (RLBWT) has attracted increased attention in string processing, and various algorithms on the RLBWT have been developed. Developing enumeration algorithms for lcp-intervals, lcp-values, and maximal repeats on the RLBWT, however, remains a challenge. 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 loglog (n/r)) time and O(r) words of working space for string length n and RLBWT size r.
READ FULL TEXT