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

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 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · DNA and Biological Computing · Network Packet Processing and Optimization
