Internal shortest absent word queries in constant time and linear space

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]

No full text available
[img] Text
Range_Absent_Words.pdf - Accepted Version
Permissions: Administrator Access Only until 26 April 2023.
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (414kB)

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:

DateEvent
4 May 2022Accepted
8 June 2022Published Online
24 June 2022Published

Item ID:

31912

Date Deposited:

15 Jun 2022 08:47

Last Modified:

20 Jun 2022 08:40

Peer Reviewed:

Yes, this version has been peer-reviewed.

URI:

https://research.gold.ac.uk/id/eprint/31912

View statistics for this item...

Edit Record Edit Record (login required)