Internal shortest absent word queries in constant time and linear space

Given a string T of length n over an alphabet Σ⊂{1,2,…,nO(1)} of size σ, we are to preprocess T so that given a range [i,j], we can return a representation of a shortest string over Σ that is absent in the fragment T[i]⋯T[j] of T. We present an O(n)-space data structure that answers such queries in...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 922; s. 271 - 282
Hlavní autoři: Badkobeh, Golnaz, Charalampopoulos, Panagiotis, Kosolobov, Dmitry, Pissis, Solon P.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 24.06.2022
Témata:
Bit parallelism
Internal queries
Shortest absent word
String algorithms
String algorithms
Bit parallelism
Shortest absent word
Internal queries
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Given a string T of length n over an alphabet Σ⊂{1,2,…,nO(1)} of size σ, we are to preprocess T so that given a range [i,j], we can return a representation of a shortest string over Σ that is absent in the fragment T[i]⋯T[j] of T. We present an O(n)-space data structure that answers such queries in constant time and can be constructed in O(nlogσ⁡n) time.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2022.04.029