Parallel Query in the Suffix Tree

Matevž Jekovec, Andrej Brodnik

Given the query string of length $m$, we explore a parallel query in a static suffix tree based data structure for $p\ll n$, where $p$ is the number of processors and $n$ is the l…