Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.procs.2013.05.067 | Procedia Computer Science |
Keywords | Field | DocType |
aprroximate string matching,bit-parallel,GPU | String searching algorithm,Commentz-Walter algorithm,Computer science,CUDA,Network security,Parallel computing,Approximate string matching,Artificial intelligence,String metric,Machine learning | Conference |
Volume | ISSN | Citations |
17 | 1877-0509 | 8 |
PageRank | References | Authors |
0.55 | 4 | 4 |