Computing Minimal Unique Substrings for a Sliding Window

Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


A substring u of a string T is called a minimal unique substring (MUS) of T if u occurs exactly once in T and any proper substring of u occurs at least twice in T. In this paper, we study the problem of computing MUSs for a sliding window over a given string T. We first show how the set of MUSs can change when the window slides over T. We then present an O(nlog σ) -time and O(d)-space algorithm to compute MUSs for a sliding window of size d over the input string T of length n, where σ≤ d is the maximum number of distinct characters in every window.

Original languageEnglish
Pages (from-to)670-693
Number of pages24
Issue number3
Publication statusPublished - Mar 2022

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • Computer Science Applications
  • Applied Mathematics


Dive into the research topics of 'Computing Minimal Unique Substrings for a Sliding Window'. Together they form a unique fingerprint.

Cite this