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

String matching has been an extensively studied research domain in the past two decades due to its various applications in the fields of text, image, signal, and speech processing. As a result, choosing an appropriate string matching algorithm for current applications and addressing challenges is di...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE access Ročník 7; s. 69614 - 69637
Hlavní autori: Hakak, Saqib Iqbal, Kamsin, Amirrudin, Shivakumara, Palaiahnakote, Gilkar, Gulshan Amin, Khan, Wazir Zada, Imran, Muhammad
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Piscataway IEEE 2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Approximate string matching
Approximation algorithms
Boyer-Moore
Classification algorithms
exact string matching
Hardware
Knuth-Morris-Pratt
Multimedia databases
pattern analysis
Pattern matching
pattern recognition
Rabin-Karp
Signal processing
Software algorithms
Speech processing
String matching
ISSN:2169-3536, 2169-3536
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:String matching has been an extensively studied research domain in the past two decades due to its various applications in the fields of text, image, signal, and speech processing. As a result, choosing an appropriate string matching algorithm for current applications and addressing challenges is difficult. Understanding different string matching approaches (such as exact string matching and approximate string matching algorithms), integrating several algorithms, and modifying algorithms to address related issues are also difficult. This paper presents a survey on single-pattern exact string matching algorithms. 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 exact string matching algorithms.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2019.2914071