{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T19:13:14Z","timestamp":1780686794426,"version":"3.54.1"},"reference-count":118,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"name":"University of Malaya Research Grant (UMRG)","award":["RP043A-17HNE & RP003A 14HNE"],"award-info":[{"award-number":["RP043A-17HNE & RP003A 14HNE"]}]},{"DOI":"10.13039\/501100011665","name":"Deanship of Scientific Research, King Saud University","doi-asserted-by":"publisher","award":["RG-1435-051"],"award-info":[{"award-number":["RG-1435-051"]}],"id":[{"id":"10.13039\/501100011665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2914071","type":"journal-article","created":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T20:27:42Z","timestamp":1556656062000},"page":"69614-69637","source":"Crossref","is-referenced-by-count":84,"title":["Exact String Matching Algorithms: Survey, Issues, and Future Research Directions"],"prefix":"10.1109","volume":"7","author":[{"given":"Saqib Iqbal","family":"Hakak","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amirrudin","family":"Kamsin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Palaiahnakote","family":"Shivakumara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gulshan Amin","family":"Gilkar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0819-4236","authenticated-orcid":false,"given":"Wazir Zada","family":"Khan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6946-2591","authenticated-orcid":false,"given":"Muhammad","family":"Imran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/0215007"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380100608"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2004.06.005"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICIInfS.2013.6731987"},{"key":"ref31","first-page":"1067","article-title":"ERS-A algorithm for pattern matching","volume":"15","author":"suleiman","year":"2013","journal-title":"Middle East J Sci Res"},{"key":"ref30","first-page":"395","article-title":"Enhanced berry ravindran pattern matching algorithm (EBR)","volume":"11","author":"suleiman","year":"2014","journal-title":"Life Sci"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90156-4"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/135239.135243"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11999-6_6"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"key":"ref28","article-title":"Algorithms for finding patterns in strings","volume":"1","author":"alfred","year":"2014","journal-title":"Algorithms and Complexity"},{"key":"ref27","first-page":"576","article-title":"The exact string matching algorithms efficiency review","volume":"4","author":"abdulrazzaq","year":"2013","journal-title":"Technology and Globalization"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2005.12"},{"key":"ref22","first-page":"205","article-title":"A hybrid indexing method for approximate string matching","volume":"1","author":"navarro","year":"2001","journal-title":"J Discrete Algorithms"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.10.043"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM.2009.42"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40450-4_12"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.10.018"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2011.03.007"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1504\/IJBRA.2009.027510"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3390\/a2031105"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1147\/rd.312.0249"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1147\/rd.62.0239"},{"key":"ref59","first-page":"65","article-title":"A very fast string matching algorithm based on condensed alphabets","author":"simone","year":"2016","journal-title":"Proc Int Conf Algorithmic Appl Manage"},{"key":"ref58","first-page":"44","article-title":"A fast multiple string-pattern matching algorithm","author":"kim","year":"1999","journal-title":"Proc 17th AoM\/IAoM Conf Comput Sci"},{"key":"ref57","first-page":"417","article-title":"Comparison of exact string matching algorithms for biological sequences","author":"kalsi","year":"2008","journal-title":"Proc 2nd Int Conf Bioinf Res Develop (BIRD)"},{"key":"ref56","article-title":"A fast algorithm for multi-pattern searching","author":"wu","year":"1994"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.01.002"},{"key":"ref54","first-page":"81","article-title":"Influenced factors on computation among quick search, two-way and Karp-Rabin algorithms","author":"abdulrazzaq","year":"2009","journal-title":"Proc 3rd Int Conf Inform Technol"},{"key":"ref53","article-title":"A survey of string matching approaches in hardware","author":"fide","year":"2008"},{"key":"ref52","article-title":"Analysis of fundamental exact and inexact pattern matching algorithms","author":"lee","year":"2004"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380221006"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-006-0011-9"},{"key":"ref3","first-page":"2637","article-title":"String matching algoritms (SMAs): Survey & Empirical analysis","volume":"2","author":"alhendawi","year":"2013","journal-title":"J Comput Sci Manage"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-011-0758-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-017-4350-5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211006"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.22452\/mjcs.vol31no3.3"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/00207160108805036"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICACTE.2010.5579620"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90046-5"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0200912"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICACI.2015.7184773"},{"key":"ref42","first-page":"16","article-title":"A fast string matching algorithm and experimental results","author":"berry","year":"1999","journal-title":"Proceedings of the Prague Stringology Club Workshop'99"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185427"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79184"},{"key":"ref43","article-title":"An enhanced Boyer-Moore algorithm","author":"ahmad","year":"2014"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/ICICSE.2009.53"},{"key":"ref72","first-page":"146","article-title":"Efficient variants of the backward-oracle-matching algorithm","author":"faro","year":"2008","journal-title":"Proc Prague Stringology Conf"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/ICAT.2006.134"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.002"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1145\/135239.135243"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1007\/11575832_42"},{"key":"ref74","first-page":"224","article-title":"Efficient online timed pattern matching by automata-based skipping","author":"masaki","year":"2017","journal-title":"Proc Conf Formal Modeling Anal Timed Syst"},{"key":"ref75","first-page":"414","article-title":"Suffix type string matching algorithms based on multi-windows and integer comparison","author":"hongbo","year":"2015","journal-title":"Proc Int Conf Inf Commun Secur"},{"key":"ref78","year":"2015","journal-title":"XML Parsing Accelerator with Intel Streaming SIMD Extensions"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39984-1_7"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/0096-0551(96)00003-3"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.5120\/7672-0963"},{"key":"ref61","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BFb0030778","article-title":"Bit-parallel approach to suffix automata: Fast extended string matching","author":"navarro","year":"1998","journal-title":"Proc Ann Symp Combinatorial Pattern Matching"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.18576\/amis\/120214"},{"key":"ref64","first-page":"1","article-title":"Efficient WU-Manber pattern matching hardware for intrusion and malware detection","author":"aldwairi","year":"2018","journal-title":"Proc Int Conf Elect Electron Comput Commun Mech Comput (EECCMC)"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2017.2753843"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.10.470"},{"key":"ref67","first-page":"118","author":"commentz-walter","year":"1979","journal-title":"A String Matching Algorithm Fast on the Average"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47849-3_18"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0200912"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1087"},{"key":"ref1","article-title":"The exact string matching algorithms efficiency review","author":"abdulrazzaq","year":"0"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.01.003"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1021\/ci030463z"},{"key":"ref108","article-title":"Parallelization of software based intrusion detection system","author":"zhang","year":"2011"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.05.028"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380250703"},{"key":"ref93","first-page":"1","article-title":"Fast variants of bit parallel approach to suffix automata","author":"holub","year":"2005","journal-title":"Proc 2nd Haifa Annu Int Stringol Res Workshop Israeli Sci Found"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70600-7_31"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0030778"},{"key":"ref105","article-title":"A research into string matching algorithms and a new string matching algorithm","author":"ersin","year":"2008"},{"key":"ref91","first-page":"118","article-title":"Searching for a substring with constant extra-space complexity","author":"cntone","year":"2004","journal-title":"Proc Int Conf Fun Algorithms"},{"key":"ref104","author":"faro","year":"2010","journal-title":"The Exact String Matching Problem a Comprehensive Experimental Evaluation"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44867-5_4"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1177\/0165551514555668"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-0129-1_20"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2017.08.004"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0198284"},{"key":"ref110","author":"science","year":"2016","journal-title":"Web of Science"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.218"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.3844\/jcssp.2008.393.401"},{"key":"ref96","first-page":"47","article-title":"TVSBS: A fast exact pattern matching algorithm for biological sequences","volume":"91","author":"thathoo","year":"2006","journal-title":"Current Sci"},{"key":"ref97","first-page":"14","article-title":"Multiple skip multiple pattern matching algorithm (MSMPMA)","volume":"34","author":"alqadi","year":"2007","journal-title":"IAENG Int J Comput Sci"},{"key":"ref10","author":"charras","year":"2004","journal-title":"Handbook of exact string matching algorithms"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2431211.2431212"},{"key":"ref12","first-page":"16","article-title":"Hardware based string matching algorithms: A survey","volume":"88","author":"ahmed","year":"2014","journal-title":"Int J Comput Appl"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.08.032"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/135239.135244"},{"key":"ref15","author":"sankoff","year":"1983","journal-title":"Common Subsequences and Monotone Subsequences"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-017-5045-7"},{"key":"ref16","first-page":"196","article-title":"Binary codes capable of correcting spurious insertions and deletions of ones","author":"levenshtein","year":"1965","journal-title":"Problems of Information Transmission"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02270-8_34"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2682109"},{"key":"ref17","first-page":"219","article-title":"String matching and its applications in diversified fields","volume":"9","author":"saikrishna","year":"2012","journal-title":"Int J Comput Sci Issues"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92182-0_45"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_101"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00092-7"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.8"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2006.11.004"},{"key":"ref114","year":"2015","journal-title":"What-is-the-Difference-Among-CPU-GPU-APU-FPGA-DSP-and-Intel-MIC"},{"key":"ref113","article-title":"Parallel processing of hybrid exact string","author":"abdulrazzaq","year":"2013","journal-title":"Proc IEEE Int Conf Control Syst Comput Eng"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1109\/ISBAST.2014.7013139"},{"key":"ref80","first-page":"126","article-title":"Filter based fast matching of long patterns by using SIMD instructions","author":"ulekci","year":"2009","journal-title":"Proc Prague Stringology Conf"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2014.01.007"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1080\/0020716031000087113"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"ref86","article-title":"Nrgrep: A fast and flexible pattern matching tool","author":"navarro","year":"2000"},{"key":"ref87","first-page":"1","article-title":"A simple tree pattern-matching algorithm","author":"lu","year":"2000","journal-title":"Proc Workshop Algorithms Theory Comput"},{"key":"ref88","first-page":"27","article-title":"New string matching technology for network security","author":"bai","year":"2003","journal-title":"Proc IEEE 17th Int Conf Adv Inf Netw Appl (AINA)"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08703383.pdf?arnumber=8703383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:40:04Z","timestamp":1628624404000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8703383\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":118,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2914071","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}