2 citations · 3 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
Sliding Suffix Tree using LCA
Andrej Brodnik, Matevž Jekovec
We consider a sliding window over a stream of characters from some alphabet of constant size. The user wants to perform deterministic substring matching on the current sliding…
cs.DS2015★ 2 cited
Parallel Query in the Suffix Tree
Matevž Jekovec, Andrej Brodnik
Given the query string of length , we explore a parallel query in a static suffix tree based data structure for , where is the number of processors and is the l…