2 papers
cs.DS2019
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
Takuya Mieno, Yuki Kuhara, Tooru Akagi +5
A substring of a string is called a minimal unique substring (MUS) of if occurs exactly once in and any proper substring of occurs at least twice in . A…
cs.DS2017
Faster STR-IC-LCS computation via RLE
Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga +2
The constrained LCS problem asks one to find a longest common subsequence of two input strings and with some constraints. The STR-IC-LCS problem is a variant of the constra…