Location of Repository

The exact online string matching problem: a review of the most recent results

By Simone Faro, Università Di Catania, Thierry Lecroq and Université De Rouen

Abstract

This article addresses the online exact string matching problem which consists in finding all occurrences of a given pattern p in a text 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

Topics: Categories and Subject Descriptors, I.7.0 [Computing Methodologies, Document and Text Processing— General, H.3.3 [Information Systems, Information Search and Retrieval—Search process General Terms, Algorithms, Design, Experimentation Additional Key Words and Phrases, string matching, experimental algorithms, text processing, automaton
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.418.3401
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www-igm.univ-mlv.fr/~le... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.