City Research Online

Internal shortest absent word queries in constant time and linear space

Badkobeh, G. ORCID: 0000-0001-5550-7149, Charalampopoulos, P., Kosolobov, D. & Pissis, S. P. (2022). Internal shortest absent word queries in constant time and linear space. Theoretical Computer Science, 922, pp. 271-282. doi: 10.1016/j.tcs.2022.04.029


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.

Publication Type: Article
Additional Information: © 2024. This manuscript version is made available under the CC-BY-NC-ND 4.0 license
Publisher Keywords: string algorithms, internal queries, shortest absent word, bit parallelism
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments: School of Science & Technology
School of Science & Technology > Computer Science
SWORD Depositor:
[thumbnail of Range_Absent_Words.pdf]
Text - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (419kB) | Preview


Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email


Downloads per month over past year

View more statistics

Actions (login required)

Admin Login Admin Login