Shortest Unique Substring Query Revisited
From MaRDI portal
Publication:5165603
DOI10.1007/978-3-319-07566-2_18zbMath1409.68354arXiv1312.2738OpenAlexW1751724878MaRDI QIDQ5165603
M. Oğuzhan Külekci, Atalay Mert İleri, Bojian Xu
Publication date: 30 June 2014
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.2738
Related Items
Space-time trade-offs for finding shortest unique substrings and maximal unique matches, A framework for space-efficient string kernels, Algorithms and combinatorial properties on shortest unique palindromic substrings, A simple yet time-optimal and linear-space algorithm for shortest unique substring queries, Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings