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.

翻译：后缀树是解决字符串问题的关键高效数据结构。后缀树是一种压缩字典树，以线性构建成本包含长度为$n$的给定文本的所有后缀。本工作提出一种构建线性索引的算法，该索引能够在O(logn)时间内查找后缀树中任意内部节点下任意长度的模式串。