Heterogeneous parallelization of Aho-Corasick algorithm

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Pattern discovery is one of the fundamental tasks in bioinformatics and pattern recognition is a powerful technique for searching sequence patterns in the biological sequence databases. The significant increase in the number of DNA and protein sequences expands the need for raising the performance of pattern matching algorithms. For this purpose, heterogeneous architectures can be a good choice due to their potential for high performance and energy efficiency. In this paper we present an efficient implementation of Aho- Corasick (AC) and PFAC (Parallel Failureless Aho-Corasick) algorithm on a heterogeneous CPU/GPU architecture. We progressively redesigned the algorithms and data structures to fit on the GPU architecture. Our results on different protein sequence data sets show 15% speedup comparing to the original implementation of the PFAC algorithm.

Cite

CITATION STYLE

APA

Soroushnia, S., Daneshtalab, M., Plosila, J., & Liljeberg, P. (2014). Heterogeneous parallelization of Aho-Corasick algorithm. In Advances in Intelligent Systems and Computing (Vol. 294, pp. 153–160). Springer Verlag. https://doi.org/10.1007/978-3-319-07581-5_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free