A linear-space data structure for range-LCP queries in poly-logarithmic time

Authors

Paniz Abedin, University of Central Florida
Arnab Ganguly, University of Wisconsin-Whitewater
Wing Kai Hon, National Tsing Hua University
Kotaro Matsuda, The University of Tokyo
Yakov Nekrich, David R. Cheriton School of Computer Science
Kunihiko Sadakane, The University of Tokyo
Rahul Shah, LSU College of Engineering
Sharma V. Thankachan, University of Central Florida

Document Type

Article

Publication Date

6-24-2020

Abstract

Let T[1,n] be a text of length n and T[i,n] be the suffix starting at position i. Also, for any two strings X and Y, let LCP(X,Y) denote their longest common prefix. The range-LCP of T w.r.t. a range [α,β], where 1≤α0 is an arbitrarily small constant. Later, Patil et al. [5] proposed another linear space structure with an improved query time of O(δlogϵ⁡δ). This poses an interesting question, whether it is possible to answer rlcp(⋅,⋅) queries in poly-logarithmic time using a linear space data structure. In this paper, we settle this question by presenting an O(n) space data structure with query time O(log1+ϵ⁡n) and construction time O(nlog⁡n).

Publication Source (Journal or Book title)

Theoretical Computer Science

First Page

15

Last Page

22

Recommended Citation

Abedin, P., Ganguly, A., Hon, W., Matsuda, K., Nekrich, Y., Sadakane, K., Shah, R., & Thankachan, S. (2020). A linear-space data structure for range-LCP queries in poly-logarithmic time. Theoretical Computer Science, 822, 15-22. https://doi.org/10.1016/j.tcs.2020.04.009