Abstract
String matching algorithms are an important element used in several computer science bb fields. These algorithms process strings of characters to find coincidences. The amount of processing required for modern applications that use string matching algorithms has increased over the years and new algorithms and solutions have been developed. In this paper we present a state of the art for the various types of string matching algorithms; and also review recent implementations done in GPU.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Security and Its Applications
Paper Title
Journal
Date
