文章基本信息

标题：On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
本地全文：下载
作者：Johannes Fischer ; Dominik K{\"o}ppl ; Florian Kurpicz 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2016
卷号：54
页码：26:1-26:11
DOI：10.4230/LIPIcs.CPM.2016.26
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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 show how to compute the suffix array interval of a given pattern of length m in O(m/p + lg p + lg lg p * lg lg n) time for p <= m. For approximate pattern matching with k differences or mismatches, we show how to compute all occurrences of a given pattern in O((m^k sigma^k)/p max (k, lg lg n) + (1+m/p) lg p * lg lg n + occ} time, where sigma is the size of the alphabet and p <= sigma^k m^k. The workhorse of our algorithms is a data structure for merging suffix array intervals quickly: Given the suffix array intervals for two patterns P and P', we present a data structure for computing the interval of PP' in O(lg lg n) sequential time, or in O(1 + lg_p lg n) parallel time. All our data structures are of size O(n) bits (in addition to the suffix array).
关键词：parallel algorithms; pattern matching; approximate string matching