2026-07-25T23:26:31Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6804 2024-03-06T10:38:55Z ddc:004 open_access

Space-Time Trade-Offs for the Shortest Unique Substring Problem Ganguly, Arnab Hon, Wing-Kai Shah, Rahul Thankachan, Sharma V. Suffix Tree Sparsification Rabin-Karp Fingerprint Probabilistic z-Fast Trie Succinct Data-Structures Given a string X[1, n] and a position k in [1, n], the Shortest Unique Substring of X covering k, denoted by S_k, is a substring X[i, j] of X which satisfies the following conditions: (i) i leq k leq j, (ii) i is the only position where there is an occurrence of X[i, j], and (iii) j - i is minimized. The best-known algorithm [Hon et al., ISAAC 2015] can find S k for all k in [1, n] in time O(n) using the string X and additional 2n words of working space. Let tau be a given parameter. We present the following new results. For any given k in [1, n], we can compute S_k via a deterministic algorithm in O(n tau^2 log n tau) time using X and additional O(n/tau) words of working space. For every k in [1, n], we can compute S_k via a deterministic algorithm in O(n tau^2 log n/tau) time using X and additional O(n/tau) words and 4n + o(n) bits of working space. For both problems above, we present an O(n tau log^{c+1} n)-time randomized algorithm that uses n/ log c n words in addition to that mentioned above, where c geq 0 is an arbitrary constant. In this case, the reported string is unique and covers k, but with probability at most n^{-O(1)} , may not be the shortest. As a consequence of our techniques, we also obtain similar space-and-time tradeoffs for a related problem of finding Maximal Unique Matches of two strings [Delcher et al., Nucleic Acids Res. 1999]. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Arnab Ganguly and Wing-Kai Hon and Rahul Shah and Sharma V. Thankachan 2016 Is Part Of LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ISAAC.2016.34 urn:nbn:de:0030-drops-68041 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.34 eng https://creativecommons.org/licenses/by/3.0/legalcode