Sliding Suffix Tree
We consider a sliding window W over a stream of characters from some alphabet of constant size. We want to look up a pattern in the current sliding window content and obtain all positions of the matches. We present an indexed version of the sliding window, based on a suffix tree. The data structure...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-08-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | http://www.mdpi.com/1999-4893/11/8/118 |
| id |
doaj-8ecbbba1000b4d7b8065f21df2bdee72 |
|---|---|
| record_format |
Article |
| spelling |
doaj-8ecbbba1000b4d7b8065f21df2bdee722020-11-24T21:06:13ZengMDPI AGAlgorithms1999-48932018-08-0111811810.3390/a11080118a11080118Sliding Suffix TreeAndrej Brodnik0Matevž Jekovec1Faculty of Computer and Information Science, University of Ljubljana, 1000 Ljubljana, SloveniaFaculty of Computer and Information Science, University of Ljubljana, 1000 Ljubljana, SloveniaWe consider a sliding window W over a stream of characters from some alphabet of constant size. We want to look up a pattern in the current sliding window content and obtain all positions of the matches. We present an indexed version of the sliding window, based on a suffix tree. The data structure of size Θ(|W|) has optimal time queries Θ(m+occ) and amortized constant time updates, where m is the length of the query string and occ is its number of occurrences.http://www.mdpi.com/1999-4893/11/8/118suffix treeonline pattern matchingsliding window |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Andrej Brodnik Matevž Jekovec |
| spellingShingle |
Andrej Brodnik Matevž Jekovec Sliding Suffix Tree Algorithms suffix tree online pattern matching sliding window |
| author_facet |
Andrej Brodnik Matevž Jekovec |
| author_sort |
Andrej Brodnik |
| title |
Sliding Suffix Tree |
| title_short |
Sliding Suffix Tree |
| title_full |
Sliding Suffix Tree |
| title_fullStr |
Sliding Suffix Tree |
| title_full_unstemmed |
Sliding Suffix Tree |
| title_sort |
sliding suffix tree |
| publisher |
MDPI AG |
| series |
Algorithms |
| issn |
1999-4893 |
| publishDate |
2018-08-01 |
| description |
We consider a sliding window W over a stream of characters from some alphabet of constant size. We want to look up a pattern in the current sliding window content and obtain all positions of the matches. We present an indexed version of the sliding window, based on a suffix tree. The data structure of size Θ(|W|) has optimal time queries Θ(m+occ) and amortized constant time updates, where m is the length of the query string and occ is its number of occurrences. |
| topic |
suffix tree online pattern matching sliding window |
| url |
http://www.mdpi.com/1999-4893/11/8/118 |
| work_keys_str_mv |
AT andrejbrodnik slidingsuffixtree AT matevzjekovec slidingsuffixtree |
| _version_ |
1716766306154315776 |