Linear Index for Logarithmic Search-Time for any String under any Internal Node in Suffix Trees
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916271271968768 |
|---|---|
| author | Al-okaily, Anas |
| author_facet | Al-okaily, Anas |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_01174 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Linear Index for Logarithmic Search-Time for any String under any Internal Node in Suffix Trees Al-okaily, Anas Data Structures and Algorithms Computational Complexity Information Theory 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. |
| title | Linear Index for Logarithmic Search-Time for any String under any Internal Node in Suffix Trees |
| topic | Data Structures and Algorithms Computational Complexity Information Theory |
| url | https://arxiv.org/abs/2406.01174 |