Wee LCP

TL;DR

This paper demonstrates that LCP information can be stored using significantly less space than previously thought, enabling efficient queries and leading to the smallest compressed suffix tree with sub-logarithmic navigation.

Contribution

It introduces a space-efficient method for storing LCP information that matches suffix array retrieval times, resulting in the smallest compressed suffix tree with fast navigation.

Findings

LCP can be stored in o(n) bits with suffix array and text

LCP queries can be answered in optimal time

Achieves the smallest compressed suffix tree with sub-logarithmic navigation

Abstract

We prove that longest common prefix (LCP) information can be stored in much less space than previously known. More precisely, we show that in the presence of the text and the suffix array, o(n) additional bits are sufficient to answer LCP-queries asymptotically in the same time that is needed to retrieve an entry from the suffix array. This yields the smallest compressed suffix tree with sub-logarithmic navigation time.