scispace - formally typeset
Journal ArticleDOI

Fast exact string matching algorithms

Thierry Lecroq
- 30 May 2007 - 
- Vol. 102, Iss: 6, pp 229-235
Reads0
Chats0
TLDR
A very fast new family of string matching algorithms based on hashing q-grams are proposed, which are the fastest on many cases, in particular, on small size alphabets.
About
This article is published in Information Processing Letters.The article was published on 2007-05-30. It has received 122 citations till now. The article focuses on the topics: String searching algorithm & Commentz-Walter algorithm.

read more

Citations
More filters
Journal ArticleDOI

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

TL;DR: This article addresses the online exact string matching problem which consists in finding all occurrences of a given pattern p in a text t and presents experimental results in order to bring order among the dozens of articles published in this area.
Journal ArticleDOI

A Malicious Pattern Detection Engine for Embedded Security Systems in the Internet of Things

TL;DR: This work presents a lightweight security system that uses a novel malicious pattern-matching engine and proposes two novel techniques, auxiliary shifting and early decision, which can efficiently reduce the number of matching operations on resource-constrained systems.
Journal ArticleDOI

Exact String Matching Algorithms: Survey, Issues, and Future Research Directions

TL;DR: The main purpose of this survey is to propose new classification, identify new directions and highlight the possible challenges, current trends, and future works in the area of string matching algorithms with a core focus on exactstring matching algorithms.
Journal ArticleDOI

Efficient variants of the backward-oracle-matching algorithm

TL;DR: It turns out that the new proposed variants of the BOM string matching algorithm are very flexible and achieve very good results, especially in the case of large alphabets.
Journal ArticleDOI

Improving practical exact string matching

TL;DR: Improved variations of the BNDM algorithm for exact string matching are presented, showing that the new variations are faster than earlier algorithms in many cases.
References
More filters
Journal ArticleDOI

Efficient randomized pattern-matching algorithms

TL;DR: In this article, the first occurrence of a string X as a consecutive block within a text Y is found by using a randomized algorithm. But the algorithm requires a constant number of storage locations, and essentially runs in real time.

A fast algorithm for multi-pattern searching

TL;DR: It is argued that, in addition to previous applications that required such search, multi-pattern matching can be used in lieu of indexed or sorted data in some applications involving small to medium size datasets.
Book

Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences

TL;DR: This book presents a practical approach to string matching problems, focusing on the algorithms and implementations that perform best in practice, and includes all of the most significant new developments in complex pattern searching.
Book

Handbook of Exact String Matching Algorithms

TL;DR: Book of handbook of exact string matching algorithms, as an amazing reference becomes what you need to get, as a source that may involve the facts, opinion, literature, religion, and many others are the great friends to join with.
Journal ArticleDOI

Fast string searching

TL;DR: Two algorithms are described that perform 47% fewer comparisons and are about 4.5 times faster across a wide range of architectures and compilers.