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

DOI10.4230/LIPIcs.CPM.2016.26zbMath1380.68471arXiv1606.02465OpenAlexW2963698105MaRDI QIDQ5369561

Johannes Fischer, Florian Kurpicz, Dominik Köppl

Publication date: 17 October 2017

Full work available at URL: https://arxiv.org/abs/1606.02465

zbMATH Keywords

parallel algorithmspattern matchingapproximate string matching

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Data structures (68P05) Algorithms on strings (68W32)

Related Items

String Indexing with Compressed Patterns, Dynamic and internal longest common substring, Faster algorithms for 1-mappability of a sequence, Longest common substring made fully dynamic, NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs