Journal ArticleDOI
A New String Matching Algorithm
Reads0
Chats0
TLDR
A new exact string-matching algorithm with sub-linear average case complexity has been presented that never performs more than n text character comparisons while working on a text of length n.Abstract:
In this paper a new exact string-matching algorithm with sub-linear average case complexity has been presented. Unlike other sub-linear string-matching algorithms it never performs more than n text character comparisons while working on a text of length n. It requires only O(mþs) extra pre-processing time and space, where m is the length of the pattern and s is the size of the alphabet.read more
Citations
More filters
Journal ArticleDOI
The exact online string matching problem: A review of the most recent results
Simone Faro,Thierry Lecroq +1 more
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
Exact String Matching Algorithms: Survey, Issues, and Future Research Directions
Saqib Hakak,Amirrudin Kamsin,Palaiahnakote Shivakumara,Gulshan Amin Gilkar,Wazir Zada Khan,Muhammad Imran +5 more
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.
Posted Content
The Exact String Matching Problem: a Comprehensive Experimental Evaluation
Simone Faro,Thierry Lecroq +1 more
TL;DR: This paper 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 compare them from a practical point of view.
A Survey of String Matching Algorithms
TL;DR: This paper presents a short survey for well-known and recent updated and hybrid string matching algorithms, divided into two major categories, known as exact string matching and approximate string matching.
Journal ArticleDOI
Combined string searching algorithm based on knuth-morris- pratt and boyer-moore algorithms
TL;DR: A combined algorithm is offered, which has been developed on the basis of well-known Knuth-Morris-Pratt and Boyer-Moore string searching algorithms, and allows acquiring the larger shift in case of pattern and string characters' mismatch.
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Journal ArticleDOI
Fast Pattern Matching in Strings
TL;DR: An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings, showing that the set of concatenations of even palindromes, i.e., the language $\{\alpha \alpha ^R\}^*$, can be recognized in linear time.
Journal ArticleDOI
A fast string searching algorithm
TL;DR: The algorithm has the unusual property that, in most cases, not all of the first i.” in another string, are inspected.
Proceedings ArticleDOI
Linear pattern matching algorithms
TL;DR: A linear time algorithm for obtaining a compacted version of a bi-tree associated with a given string is presented and indicated how to solve several pattern matching problems, including some from [4] in linear time.
Journal ArticleDOI
Efficient randomized pattern-matching algorithms
Richard M. Karp,Michael O. Rabin +1 more
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.