Faster Range LCP Queries in Linear Space

Document Type

Conference Proceeding

Publication Date

8-11-2025

Department

Department of Computer Science

Abstract

A range LCP query rlcp(α, β) on a text T[1..n] asks to return the length of the longest common prefix of any two suffixes of T with starting positions in a range [α, β]. In this paper we describe a data structure that uses O(n) space and supports range LCP queries in time O(logε n) for any constant ε > 0. Our result is the fastest currently known linear-space solution for this problem.

Publication Title

Openaccess Series in Informatics

ISBN

9783959773911

Link to Full Text

Share

COinS