{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T12:43:13Z","timestamp":1760013793774,"version":"3.40.5"},"reference-count":44,"publisher":"Wiley","license":[{"start":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T00:00:00Z","timestamp":1700438400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Posts, Telecommunications and Information Technology, Government of People\u2019s Republic of Bangladesh"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Computational Intelligence and Soft Computing"],"published-print":{"date-parts":[[2023,11,20]]},"abstract":"<jats:p>Pattern matching algorithms have gained a lot of importance in computer science, primarily because they are used in various domains such as computational biology, video retrieval, intrusion detection systems, and fraud detection. Finding one or more patterns in a given text is known as pattern matching. Two important things that are used to judge how well exact pattern matching algorithms work are the total number of attempts and the character comparisons that are made during the matching process. The primary focus of our proposed method is reducing the size of both components wherever possible. Despite sprinting, hash-based pattern matching algorithms may have hash collisions. The Efficient Hashing Method (EHM) algorithm is improved in this research. Despite the EHM algorithm\u2019s effectiveness, it takes a lot of time in the preprocessing phase, and some hash collisions are generated. A novel hashing method has been proposed, which has reduced the preprocessing time and hash collision of the EHM algorithm. We devised the Hashing Approach for Pattern Matching (HAPM) algorithm by taking the best parts of the EHM and Quick Search (QS) algorithms and adding a way to avoid hash collisions. The preprocessing step of this algorithm combines the bad character table from the QS algorithm, the hashing strategy from the EHM algorithm, and the collision-reducing mechanism. To analyze the performance of our HAPM algorithm, we have used three types of datasets: E. coli, DNA sequences, and protein sequences. We looked at six algorithms discussed in the literature and compared our proposed method. The Hash-q with Unique FNG (HqUF) algorithm was only compared with E. coli and DNA datasets because it creates unique bits for DNA sequences. Our proposed HAPM algorithm also overcomes the problems of the HqUF algorithm. The new method beats older ones regarding average runtime, number of attempts, and character comparisons for long and short text patterns, though it did worse on some short patterns.<\/jats:p>","DOI":"10.1155\/2023\/3278505","type":"journal-article","created":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T21:35:08Z","timestamp":1700516108000},"page":"1-16","source":"Crossref","is-referenced-by-count":3,"title":["An Improved Hashing Approach for Biological Sequence to Solve Exact Pattern Matching Problems"],"prefix":"10.1155","volume":"2023","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8891-7870","authenticated-orcid":true,"given":"Prince","family":"Mahmud","sequence":"first","affiliation":[{"name":"Computer Science and Engineering Discipline, Khulna University, Khulna 9208, Bangladesh"}]},{"given":"Anisur","family":"Rahman","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering Discipline, Khulna University, Khulna 9208, Bangladesh"}]},{"given":"Kamrul","family":"Hasan Talukder","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering Discipline, Khulna University, Khulna 9208, Bangladesh"}]}],"member":"311","reference":[{"key":"1","first-page":"8887","article-title":"Pattern matching in file system","volume-title":"International Journal of Computer Application","author":"K. Vayadande"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/access.2020.2969038"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-021-00369-3"},{"key":"4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/978-3-030-98741-1_16","article-title":"A survey of the hybrid exact string matching algorithms","volume":"127","author":"F. Mohammed","year":"2022","journal-title":"Advances on Intelligent Informatics and Computing: Health Informatics, Intelligent Systems, Data Science and Smart Computing"},{"key":"5","first-page":"1","article-title":"Biological sequence databases","volume-title":"Bioinformatics","author":"A. D. Baxevanis","year":"2020"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-022-04673-3"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2018.2885296"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.7292"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11814"},{"article-title":"A survey on locality sensitive hashing algorithms and their applications","year":"2021","author":"O. Jafari","key":"10"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2914071"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.3390\/e23010031"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.08.028"},{"issue":"11","key":"14","article-title":"Approximate multiple string matching algorithm","volume":"98","author":"J. Rekha","year":"2020","journal-title":"Journal of Theoretical and Applied Information Technology"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.17485\/ijst\/2017\/v10i3\/84939"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.10.009"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-019-09646-y"},{"first-page":"224","article-title":"Efficient online timed pattern matching by automata-based skipping","author":"M. Waga","key":"18"},{"first-page":"289","article-title":"An efficient hashing method for exact string matching problems","author":"P. Mahmud","key":"19"},{"first-page":"1","article-title":"Increasing memory efficiency of hash-based pattern matching for high-speed networks","author":"T. Fuka\u010d","key":"20"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2022.103057"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2021.104656"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.54209\/infosains.v10i1.29"},{"issue":"8","key":"24","article-title":"Comparative analysis of brute force and boyer moore algorithms in word suggestion search","volume":"9","author":"Layustira","year":"2021","journal-title":"International Journal"},{"issue":"1","key":"25","doi-asserted-by":"crossref","DOI":"10.1063\/5.0154311","article-title":"The application Boyer Moore algorithm to answered crossword puzzle","volume":"2798","author":"D. Purba","year":"2023","journal-title":"AIP Conference Proceedings"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.11591\/ijai.v10.i3.pp519-527"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2020.02.017"},{"issue":"1","key":"28","article-title":"Prevalent exact string-matching algorithms in natural language processing: a review","volume":"1854","author":"R. K. Pandey","year":"2021","journal-title":"Journal of Physics: Conference Series"},{"first-page":"160","article-title":"A hybrid algorithm for pattern matching: an integration of berry-ravindran and raita algorithms","author":"A. A. Almazroi","key":"29"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1007\/s41870-019-00371-1"},{"first-page":"66","article-title":"Parallel hybrid string matching algorithm using CUDA API function","author":"Al-Dabbagh","key":"31"},{"first-page":"1","article-title":"Maximum-shift string matching algorithms","author":"Kadhim","key":"32"},{"first-page":"1","article-title":"An efficient hybrid exact string matching algorithm to minimize the number of attempts and character comparisons","author":"P. Mahmud","key":"33"},{"issue":"9","key":"34","first-page":"94","article-title":"RABIN-KARP algorithm in algorithms","volume":"2","author":"A. Dilobar","year":"2023","journal-title":"Journal of Integrated Education and Research"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.14419\/ijet.v7i2.27.12084"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.09.031"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.6505"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2021.104292"},{"issue":"12","key":"39","first-page":"1471","article-title":"Survey and comparison of string matching algorithms","volume":"12","author":"A. R. Chayapathi","year":"2021","journal-title":"Turkish Journal of Computer and Mathematics Education (TURCOMAT)"},{"first-page":"136","article-title":"Fast genome analysis leveraging exact string matching","author":"B. Branchini","key":"40"},{"first-page":"1","article-title":"Comparative analysis of pattern matching algorithms using DNA sequences","author":"K. Duvvuri","key":"41"},{"article-title":"National center for biotechnology information","year":"2023","author":"Ncbi","key":"42"},{"article-title":"The Text Collection","year":"2023","author":"Pizzachili","key":"43"},{"article-title":"Escherichia coli str. K-12 substr. DH10B, complete sequence dataset, NCBI data","year":"2023","author":"G. Plunkett","key":"44"}],"container-title":["Applied Computational Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2023\/3278505.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2023\/3278505.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/acisc\/2023\/3278505.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T21:35:27Z","timestamp":1700516127000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/acisc\/2023\/3278505\/"}},"subtitle":[],"editor":[{"given":"Anandakumar","family":"Haldorai","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2023,11,20]]},"references-count":44,"alternative-id":["3278505","3278505"],"URL":"https:\/\/doi.org\/10.1155\/2023\/3278505","relation":{},"ISSN":["1687-9732","1687-9724"],"issn-type":[{"type":"electronic","value":"1687-9732"},{"type":"print","value":"1687-9724"}],"subject":[],"published":{"date-parts":[[2023,11,20]]}}}