Thumbnail
Access Restriction
Subscribed

Author Faro, Simone ♦ Lecroq, Thierry
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2013
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword String matching ♦ Automaton ♦ Experimental algorithms ♦ Text processing
Abstract This article addresses the online exact string matching problem which consists in finding $\textit{all}$ occurrences of a given pattern $\textit{p}$ in a text $\textit{t}.$ It is an extensively studied problem in computer science, mainly due to its direct applications to such diverse areas as text, image and signal processing, speech analysis and recognition, information retrieval, data compression, computational biology and chemistry. In the last decade more than 50 new algorithms have been proposed for the problem, which add up to a wide set of (almost 40) algorithms presented before 2000. In this article we review the string matching algorithms presented in the last decade and present experimental results in order to bring order among the dozens of articles published in this area.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2013-03-12
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 45
Issue Number 2
Page Count 42
Starting Page 1
Ending Page 42


Open content in new tab

   Open content in new tab
Source: ACM Digital Library