Parallel Implementation of the Wu-Manber Algorithm Using the OpenCL Framework

One of the most significant issues of the computational biology is the multiple pattern matching for locating nucleotides and amino acid sequence patterns into biological databases. Sequential implementations for these processes have become inadequate, due to an increasing demand for more computational power. Graphic cards offer a high parallelism computational power improving the performance of applications. This paper evaluates the performance of the Wu-Manber algorithm implemented with the OpenCL framework, by presenting the running time of the experiments compared with the corresponding sequential time.

[1]  Alfred V. Aho,et al.  Efficient string matching , 1975, Commun. ACM.

[2]  J. Xu OpenCL – The Open Standard for Parallel Programming of Heterogeneous Systems , 2009 .

[3]  Jyuo-Min Shyu,et al.  Accelerating String Matching Using Multi-Threaded Algorithm on GPU , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[4]  Udi Manber,et al.  A FAST ALGORITHM FOR MULTI-PATTERN SEARCHING , 1999 .

[5]  Konstantinos G. Margaritis,et al.  Performance Study of Parallel Hybrid Multiple Pattern Matching Algorithms for Biological Sequences , 2012, BIOINFORMATICS.

[6]  Nen-Fu Huang,et al.  A GPU-Based Multiple-Pattern Matching Algorithm for Network Intrusion Detection Systems , 2008, 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008).

[7]  Kwong-Sak Leung,et al.  A fast CUDA implementation of agrep algorithm for approximate nucleotide sequence matching , 2011, 2011 IEEE 9th Symposium on Application Specific Processors (SASP).

[8]  Jean-Stéphane Varré,et al.  Bit-Parallel Multiple Pattern Matching , 2011, PPAM.