A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
type: Item
instance of: scholarly article
title: A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
zbMATH Open document ID: 1303.68163
author: Atalay M. Ileri
author: M. Oğuzhan Külekci
author: Bojian Xu
published in: Theoretical Computer Science
publication date: 2014-12-02T00:00:00Z
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 6376006
zbMATH Keywords: unique substring
zbMATH Keywords: shortest unique substring
zbMATH Keywords: repetitiveness
zbMATH Keywords: regularity
describes a project that uses: REPuter
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.11.004
OpenAlex ID: W2040322457
cites work: Jewels of Stringology
cites work: Algorithms on Strings, Trees and Sequences
cites work: Shortest Unique Substring Query Revisited
cites work: Minimum Unique Substrings and Maximum Repeats
cites work: Q4547749
cites work: Space efficient linear time construction of suffix arrays
cites work: Computing regularities in strings: a survey
cites work: Shortest Unique Substrings Queries in Optimal Time
DOI: 10.1016/J.TCS.2014.11.004
description: scientific article; zbMATH DE number 6376006