Linear Index for Logarithmic Search-Time for any String under any Internal Node in Suffix Trees

TL;DR

This paper introduces a linear index for suffix trees that enables pattern searches under any internal node in logarithmic time, improving search efficiency for string problems.

Contribution

The work presents a novel linear index construction algorithm that achieves O(log n) search time for patterns under any internal node in suffix trees.

Findings

Enables pattern search under any internal node in O(log n) time

Constructs a linear index with efficient search capabilities

Improves suffix tree query performance

Abstract

Suffix trees are key and efficient data structure for solving string problems. A suffix tree is a compressed trie containing all the suffixes of a given text of length $n$ with a linear construction cost. In this work, we introduce an algorithm to build a linear index that allows finding a pattern of any length under any internal node in a suffix tree in O(logn) time.