Shortest Unique Substrings Queries in Optimal Time
From MaRDI portal
Publication:2938125
DOI10.1007/978-3-319-04298-5_44zbMath1432.68612MaRDI QIDQ2938125
Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Publication date: 13 January 2015
Published in: SOFSEM 2014: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-04298-5_44
Related Items
Data structures for computing unique palindromes in static and non-static strings, A simple yet time-optimal and linear-space algorithm for shortest unique substring queries, Algorithms and combinatorial properties on shortest unique palindromic substrings, Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings, Computing minimal unique substrings for a sliding window, Space-efficient algorithms for computing minimal/shortest unique substrings, In-place algorithms for exact and approximate shortest unique substring problems, Space-time trade-offs for finding shortest unique substrings and maximal unique matches, Minimal Unique Substrings and Minimal Absent Words in a Sliding Window