Journal ArticleDOI
Hybrid string matching algorithm with a pivot
Reads0
Chats0
TLDR
The proposed algorithm is a hybrid that combines the modification of Horspool's algorithm with two observations on string matching and scans the text from left to right and matches the pattern from right to left.Abstract:
Pattern matching is important in text processing, molecular biology, operating systems and web search engines. Many algorithms have been developed to search for a specific pattern in a text, but the need for an efficient algorithm is an outstanding issue. In this paper, we present a simple and practical string matching algorithm. The proposed algorithm is a hybrid that combines our modification of Horspool's algorithm with two observations on string matching. The algorithm scans the text from left to right and matches the pattern from right to left. Experimental results on natural language texts, genomes and human proteins demonstrate that the new algorithm is competitive with practical algorithms.read more
Citations
More filters
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.
Journal ArticleDOI
An accurate toponym-matching measure based on approximate string matching
TL;DR: The creation of a single string-matching measure that can perform toponym matching process regardless of the language was attempted, and the creation of an ASM measure called DAS, which comprises name similarity, word similarity and sentence similarity phases, was created.
Journal ArticleDOI
A new split based searching for exact pattern matching for natural texts.
Saqib Hakak,Amirrudin Kamsin,Palaiahnakote Shivakumara,Mohd Yamani Idna Idris,Gulshan Amin Gilkar +4 more
TL;DR: Experimental results on different S1 Dataset, namely Arabic, English, Chinese, Italian and French text databases show that the proposed algorithm outperforms the existing S1 Algorithm in terms of time efficiency and memory consumption as the length of the query pattern increases.
Journal ArticleDOI
Faster string matching based on hashing and bit-parallelism
TL;DR: Experimental results confirm that the proposed algorithm, namely FHASHq, is faster than Hashingq, SBNDMq and FSBNDM algorithms on alphabets of size 4 (DNA alphabet), 128, 256, and 512.
Journal ArticleDOI
Partition-based pattern matching approach for efficient retrieval of arabic text
TL;DR: A new partition-based pattern matching approach that divides the query words into two equal parts (sub-parts) and uses a parallel search to match the content in the database outperforms all other existing approaches in terms of computational time.
References
More filters
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.
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.
Journal ArticleDOI
A new approach to text searching
TL;DR: 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 are introduced.
Journal ArticleDOI
Practical Fast Searching in Strings
TL;DR: It is discovered that a method developed by Boyer and Moore can outperform even special‐purpose search instructions that may be built into the computer hardware for very short substrings.