A new approach to text searching

Authors:
R. A. Baeza-Yates;G. H. Gonnet
Affiliations:
Centre for the New O.E.D., & Data Structuring Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada;Centre for the New O.E.D., & Data Structuring Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada
Venue:
SIGIR '89 Proceedings of the 12th annual international ACM SIGIR conference on Research and development in information retrieval
Year:
1989

Citing 0
Cited 10

Algorithms for string searching

ACM SIGIR Forum
A new approach to text searching

Communications of the ACM
Fast text searching: allowing errors

Communications of the ACM
Analysis of Boyer-Moore-type string searching algorithms

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Metadata for Anomaly-Based Security Protocol Attack Deduction

IEEE Transactions on Knowledge and Data Engineering
A system architecture for high-speed deep packet inspection in signature-based network intrusion prevention

Journal of Systems Architecture: the EUROMICRO Journal
Indexing and querying XML using extended Dewey labeling scheme

Data & Knowledge Engineering
A high-throughput system architecture for deep packet filtering in network intrusion prevention

ARCS'06 Proceedings of the 19th international conference on Architecture of Computing Systems
Pattern matching acceleration for network intrusion detection systems

SAMOS'05 Proceedings of the 5th international conference on Embedded Computer Systems: architectures, Modeling, and Simulation
Bit-parallel multiple pattern matching

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II

Quantified Score

Hi-index	0.03

Visualization

Abstract

We introduce a family of simple and fast algorithms for solving the classical string matching problem, string matching with don't care symbols and complement symbols, and multiple patterns. In addition we solve the same problems allowing up to k mismatches. Among the features of these algorithms are that they are real time algorithms, they don't need to buffer the input, and they are suitable to be implemented in hardware.