2 citations · 3 across the 3 of their papers we have counts for
3 papers
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.DC2016★ 1 cited
ERA Revisited: Theoretical and Experimental Evaluation
Matevž Jekovec, Andrej Brodnik
Efficient construction of the suffix tree given an input text is an active area of research from the time it was first introduced. Both theoretical computer scientists and engineer…
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…