The exact online string matching problem: a review of the most recent results
type: Item
instance of: scholarly article
zbMATH Open document ID: 1293.68314
DOI: 10.1145/2431211.2431212
author: Simone Faro
author: Thierry Lecroq
published in: ACM Computing Surveys
publication date: 2014-08-13T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68-02
zbMATH DE Number: 6330007
zbMATH Keywords: string matching
zbMATH Keywords: automaton
zbMATH Keywords: experimental algorithms
zbMATH Keywords: text processing
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1145/2431211.2431212
OpenAlex ID: W1983788629
Recommended article: On-line string matching algorithms: survey and experimental results
Recommended article: On-line approximate string matching with bounded errors
Recommended article: On-Line Approximate String Matching with Bounded Errors
Recommended article: On-Line Approximate String Searching Algorithms: Survey and Experimental Results
Recommended article: Optimal On-Line Search and Sublinear Time Update in String Matching
Recommended article: A Fast Suffix Automata Based Algorithm for Exact Online String Matching
Recommended article: Q4228434
Recommended article: On the Exact Complexity of String Matching: Upper Bounds
Recommended article: On the Exact Complexity of String Matching: Lower Bounds
Recommended article: Exact bounds on the complexity of sequential string matching algorithms
title: The exact online string matching problem: a review of the most recent results
description: scientific article; zbMATH DE number 6330007