Internal shortest absent word queries in constant time and linear space

Tools

Badkobeh, Golnaz; Charalampopoulos, Panagiotis; Kosolobov, Dmitry and Pissis, Solon P.. 2022. Internal shortest absent word queries in constant time and linear space. Theoretical Computer Science, 922, pp. 271-282. ISSN 0304-3975 [Article]

Preview

Text
Range_Absent_Words.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.
Download (414kB) | Preview

Official URL: https://doi.org/10.1016/j.tcs.2022.04.029

Item Type:

Article

Identification Number (DOI):

https://doi.org/10.1016/j.tcs.2022.04.029

Additional Information:

The present paper is an extended and improved version of an earlier text that appeared in the 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021

Keywords:

String algorithms, Internal queries, Shortest absent word, Bit parallelism

Departments, Centres and Research Units:

Computing

Dates: