{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:31:49Z","timestamp":1753882309848,"version":"3.41.2"},"reference-count":13,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comp. Intel. Appl."],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:p> With the appearance of complete mammalian genomes, comparative approaches have experienced a recent upsurge. Searching maximal exact match is among the most used tasks in sequence searching within a larger DNA sequence or database. Many exact algorithms have been designed to deal with this problem. The best improvements made by these algorithms have led to a time and space complexity of O(n) and they remain practically less effective for large sequences. Heuristic methods will therefore be a good alternative to implement. In this work, we present an efficient heuristic algorithm based on PSO metaheuristic to deal with the problem of searching the maximal exact match of small searched sequences in large ones. The time and space complexity of the designed algorithm is of O(1). The experimental results showed the efficiency of the proposed search algorithm for finding maximal exact match in large sequences when compared with two other sequence searching algorithms. <\/jats:p>","DOI":"10.1142\/s1469026823500220","type":"journal-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T06:39:44Z","timestamp":1689316784000},"source":"Crossref","is-referenced-by-count":0,"title":["An Efficient PSO-Based Algorithm for Finding Maximal Exact Match in Large DNA Sequences"],"prefix":"10.1142","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5938-9263","authenticated-orcid":false,"given":"Mohamed Skander","family":"Daas","sequence":"first","affiliation":[{"name":"Department of Applied Biology, University of Fr\u00e8res Mentouri Constantine 1, Constantine 25000, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Billel","family":"Kenidra","sequence":"additional","affiliation":[{"name":"Ecole Nationale Suprieure dInformatique (ESI), BP 68M Oued-Smar, Alger 16270, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamza","family":"Bouanaka","sequence":"additional","affiliation":[{"name":"Department of Applied Biology, University of Fr\u00e8res Mentouri Constantine 1, Constantine 25000, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salim","family":"Chikhi","sequence":"additional","affiliation":[{"name":"MISC Laboratory, University of Abdelhamid Mehri Constantine 2, Constantine 25000, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2023,7,13]]},"reference":[{"key":"S1469026823500220BIB001","first-page":"1","volume-title":"Applied Biomedical Engineering Using Artificial Intelligence and Cognitive Models","author":"Garza-Ulloa J.","year":"2022"},{"key":"S1469026823500220BIB002","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq364"},{"key":"S1469026823500220BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00744-0"},{"key":"S1469026823500220BIB004","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1954-09848-8"},{"key":"S1469026823500220BIB006","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.13"},{"key":"S1469026823500220BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206331"},{"key":"S1469026823500220BIB008","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"S1469026823500220BIB009","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp275"},{"volume-title":"Annual Symp. Combinatorial Pattern Matching (CPM 2018)","year":"2018","author":"Amir A.","key":"S1469026823500220BIB011"},{"key":"S1469026823500220BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00744-0"},{"key":"S1469026823500220BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_50"},{"key":"S1469026823500220BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38905-4_22"},{"key":"S1469026823500220BIB017","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4_11"}],"container-title":["International Journal of Computational Intelligence and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1469026823500220","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T07:06:39Z","timestamp":1704006399000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1469026823500220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,13]]},"references-count":13,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["10.1142\/S1469026823500220"],"URL":"https:\/\/doi.org\/10.1142\/s1469026823500220","relation":{},"ISSN":["1469-0268","1757-5885"],"issn-type":[{"type":"print","value":"1469-0268"},{"type":"electronic","value":"1757-5885"}],"subject":[],"published":{"date-parts":[[2023,7,13]]},"article-number":"2350022"}}