Shortest Unique Substring Queries on Run-Length Encoded Strings
From MaRDI portal
Publication:4608632
DOI10.4230/LIPIcs.MFCS.2016.69zbMath1398.68109OpenAlexW2533951358MaRDI QIDQ4608632
Masayuki Takeda, Takuya Mieno, Hideo Bannai, Shunsuke Inenaga
Publication date: 21 March 2018
Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.MFCS.2016.69
Related Items
Space-time trade-offs for finding shortest unique substrings and maximal unique matches, Space-efficient algorithms for computing minimal/shortest unique substrings, Algorithms and combinatorial properties on shortest unique palindromic substrings, Minimal Unique Substrings and Minimal Absent Words in a Sliding Window, Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings, Computing minimal unique substrings for a sliding window