Linear Index for Logarithmic Search-Time for any String under any Internal Node in Suffix Trees
<|reference_start|>Linear Index for Logarithmic Search-Time for any String under any Internal Node in Suffix Trees: 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.<|reference_end|>
@article{al-okaily2024linear,
    title={Linear Index for Logarithmic Search-Time for any String under any
  Internal Node in Suffix Trees},
    author={Anas Al-okaily},
    journal={arXiv preprint arXiv:2406.01174},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.01174},
    primaryClass={cs.DS cs.CC cs.IT math.IT}
}