Computing minimal unique substrings for a sliding window
type: Item
instance of: scholarly article
title: Computing minimal unique substrings for a sliding window
author: Takuya Mieno
author: Yuta Fujishige
author: Yuto Nakashima
author: Shunsuke Inenaga
author: Hideo Bannai
author: Masayuki Takeda
published in: Algorithmica
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7495491
zbMATH Keywords: minimal unique substring
zbMATH Keywords: sliding window
zbMATH Keywords: suffix tree
MaRDI profile type: Publication
full work available at URL: s00453-021-00864-1
OpenAlex ID: W3195757721
cites work: Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
cites work: Absent words in a sliding window with applications
cites work: Space-time trade-offs for finding shortest unique substrings and maximal unique matches
cites work: In-place algorithms for exact and approximate shortest unique substring problems
cites work: String processing and information retrieval. 21st international symposium, SPIRE 2014, Ouro Preto, Brazil, October 20--22, 2014. Proceedings
cites work: A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
cites work: Minimum Unique Substrings and Maximum Repeats
cites work: Shortest Unique Substring Queries on Run-Length Encoded Strings
cites work: Words and forbidden factors
cites work: Shortest Unique Substrings Queries in Optimal Time
cites work: On-line construction of suffix trees
cites work: A universal algorithm for sequential data compression
DOI: 10.1007/S00453-021-00864-1
description: scientific article; zbMATH DE number 7495491