Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
From MaRDI portal
Publication:3297764
DOI10.1007/978-3-030-38919-2_13zbMath1440.68343arXiv1909.02804OpenAlexW3003549958MaRDI QIDQ3297764
Yuki Kuhara, Takuya Mieno, Hideo Bannai, Masayuki Takeda, Tooru Akagi, Shunsuke Inenaga, Yuta Fujishige, Yuto Nakashima
Publication date: 20 July 2020
Published in: SOFSEM 2020: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.02804
Related Items (7)
Combinatorics of minimal absent words for a sliding window ⋮ Internal shortest absent word queries in constant time and linear space ⋮ Reverse-Safe Text Indexing ⋮ Absent Subsequences in Words ⋮ Absent subsequences in words ⋮ Palindromic trees for a sliding window and its applications ⋮ Computing minimal unique substrings for a sliding window
Cites Work
- Using minimal absent words to build phylogeny
- Minimal absent words in a sliding window and applications to on-line pattern matching
- On-line construction of suffix trees
- Dynamic construction of an antidictionary with linear complexity
- Shortest Unique Substrings Queries in Optimal Time
- A universal algorithm for sequential data compression
- Shortest Unique Substring Queries on Run-Length Encoded Strings
This page was built for publication: Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
