On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching

Johannes Fischer, Dominik Köppl, Florian Kurpicz

We present parallel algorithms for exact and approximate pattern matching with suffix arrays, using a CREW-PRAM with $p$ processors. Given a static text of length $n$, we first sho…