Bit-Parallel Multiple Approximate String Matching based on GPU

Approximate string matching is one of the most important technologies in the field of computer science, and it is widely used in network security, computational biology, information retrieval, spelling correction and other areas. In these areas, there are huge amounts of data need to be addressed in...

Full description

Saved in:
Bibliographic Details
Published inProcedia computer science Vol. 17; pp. 523 - 529
Main Authors Xu, Kefu, Cui, Wenke, Hu, Yue, Guo, Li
Format Journal Article
LanguageEnglish
Published Elsevier B.V 2013
Subjects
aprroximate string matching
bit-parallel
GPU
bit-parallel
aprroximate string matching
GPU
Online AccessGet full text

Cover

More Information
Summary:Approximate string matching is one of the most important technologies in the field of computer science, and it is widely used in network security, computational biology, information retrieval, spelling correction and other areas. In these areas, there are huge amounts of data need to be addressed in time. So it requires a high- performance string matching algorithm. At the same time, with the introduction of Compute Unified Device Architecture (CUDA), the general-purpose computing of Graphic Processing Unit (GPU) extended to more applications. This paper proposed a bit-parallel multiple approximate string match algorithm, and developed a GPU implementation which achieved speedups about 28 relative to a single-thread CPU code.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2013.05.067