{"id":"https://openalex.org/W4384341968","doi":"https://doi.org/10.1142/s1469026823500220","title":"An Efficient PSO-Based Algorithm for Finding Maximal Exact Match in Large DNA Sequences","display_name":"An Efficient PSO-Based Algorithm for Finding Maximal Exact Match in Large DNA Sequences","publication_year":2023,"publication_date":"2023-07-13","ids":{"openalex":"https://openalex.org/W4384341968","doi":"https://doi.org/10.1142/s1469026823500220"},"language":"en","primary_location":{"id":"doi:10.1142/s1469026823500220","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1142/s1469026823500220","pdf_url":null,"source":{"id":"https://openalex.org/S206936884","display_name":"International Journal of Computational Intelligence and Applications","issn_l":"1469-0268","issn":["1469-0268","1757-5885"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003130677","display_name":"Mohamed Skander Daas","orcid":"https://orcid.org/0000-0002-5938-9263"},"institutions":[{"id":"https://openalex.org/I125485651","display_name":"University Fr\u00e8res Mentouri Constantine 1","ror":"https://ror.org/017wv6808","country_code":"DZ","type":"education","lineage":["https://openalex.org/I125485651"]}],"countries":["DZ"],"is_corresponding":true,"raw_author_name":"Mohamed Skander Daas","raw_affiliation_strings":["Department of Applied Biology, University of Fr\u00e8res Mentouri Constantine 1, Constantine 25000, Algeria"],"raw_orcid":"https://orcid.org/0000-0002-5938-9263","affiliations":[{"raw_affiliation_string":"Department of Applied Biology, University of Fr\u00e8res Mentouri Constantine 1, Constantine 25000, Algeria","institution_ids":["https://openalex.org/I125485651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030944764","display_name":"Billel Kenidra","orcid":"https://orcid.org/0000-0002-8383-1795"},"institutions":[{"id":"https://openalex.org/I4210149016","display_name":"\u00c9cole Nationale Sup\u00e9rieure d'Informatique","ror":"https://ror.org/04dj1dn66","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210149016"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Billel Kenidra","raw_affiliation_strings":["Ecole Nationale Suprieure dInformatique (ESI), BP 68M Oued-Smar, Alger 16270, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ecole Nationale Suprieure dInformatique (ESI), BP 68M Oued-Smar, Alger 16270, Algeria","institution_ids":["https://openalex.org/I4210149016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047239529","display_name":"Hamza Bouanaka","orcid":"https://orcid.org/0000-0003-0695-0157"},"institutions":[{"id":"https://openalex.org/I125485651","display_name":"University Fr\u00e8res Mentouri Constantine 1","ror":"https://ror.org/017wv6808","country_code":"DZ","type":"education","lineage":["https://openalex.org/I125485651"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Hamza Bouanaka","raw_affiliation_strings":["Department of Applied Biology, University of Fr\u00e8res Mentouri Constantine 1, Constantine 25000, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Biology, University of Fr\u00e8res Mentouri Constantine 1, Constantine 25000, Algeria","institution_ids":["https://openalex.org/I125485651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055982084","display_name":"Salim Ch\u0131kh\u0131","orcid":"https://orcid.org/0000-0002-8369-8533"},"institutions":[{"id":"https://openalex.org/I4210160465","display_name":"Universit\u00e9 Constantine 2","ror":"https://ror.org/056mctw68","country_code":"DZ","type":"education","lineage":["https://openalex.org/I4210160465"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Salim Chikhi","raw_affiliation_strings":["MISC Laboratory, University of Abdelhamid Mehri Constantine 2, Constantine 25000, Algeria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MISC Laboratory, University of Abdelhamid Mehri Constantine 2, Constantine 25000, Algeria","institution_ids":["https://openalex.org/I4210160465"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5003130677"],"corresponding_institution_ids":["https://openalex.org/I125485651"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07480994,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"04","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7341522574424744},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6945523619651794},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6757752299308777},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6602205038070679},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.44635048508644104},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44634106755256653},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.43810755014419556},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.43112361431121826},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4137919545173645},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4110676944255829},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3876928389072418},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22213837504386902},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1853635609149933},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1151207983493805}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7341522574424744},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6945523619651794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6757752299308777},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6602205038070679},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.44635048508644104},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44634106755256653},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.43810755014419556},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.43112361431121826},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4137919545173645},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4110676944255829},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3876928389072418},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22213837504386902},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1853635609149933},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1151207983493805},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1469026823500220","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1142/s1469026823500220","pdf_url":null,"source":{"id":"https://openalex.org/S206936884","display_name":"International Journal of Computational Intelligence and Applications","issn_l":"1469-0268","issn":["1469-0268","1757-5885"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1732081968","https://openalex.org/W1980516134","https://openalex.org/W2059513841","https://openalex.org/W2158874082","https://openalex.org/W2160625600","https://openalex.org/W2171196697","https://openalex.org/W2279569755","https://openalex.org/W2533248932","https://openalex.org/W3043437193","https://openalex.org/W4205635102","https://openalex.org/W4255330465"],"related_works":["https://openalex.org/W2789681586","https://openalex.org/W2794361564","https://openalex.org/W4243392960","https://openalex.org/W3156820950","https://openalex.org/W4232791346","https://openalex.org/W1581805909","https://openalex.org/W1589381382","https://openalex.org/W961142965","https://openalex.org/W4302010637","https://openalex.org/W2034510042"],"abstract_inverted_index":{"With":[0],"the":[1,20,97,101,118,128,131],"appearance":[2],"of":[3,60,99,105,117,122,130],"complete":[4],"mammalian":[5],"genomes,":[6],"comparative":[7],"approaches":[8],"have":[9,37,52],"experienced":[10],"a":[11,28,55,76],"recent":[12],"upsurge.":[13],"Searching":[14],"maximal":[15,102,137],"exact":[16,35,103,138],"match":[17,104,139],"is":[18,121],"among":[19],"most":[21],"used":[22],"tasks":[23],"in":[24,109,140],"sequence":[25,31,148],"searching":[26,100,149],"within":[27],"larger":[29],"DNA":[30],"or":[32],"database.":[33],"Many":[34],"algorithms":[36,51],"been":[38],"designed":[39,119],"to":[40,54,79,94],"deal":[41,95],"with":[42,96,145],"this":[43,82],"problem.":[44],"The":[45,112,124],"best":[46],"improvements":[47],"made":[48],"by":[49],"these":[50],"led":[53],"time":[56,113],"and":[57,62,114],"space":[58,115],"complexity":[59,116],"O(n)":[61],"they":[63],"remain":[64],"practically":[65],"less":[66],"effective":[67],"for":[68,135],"large":[69,110,141],"sequences.":[70],"Heuristic":[71],"methods":[72],"will":[73],"therefore":[74],"be":[75],"good":[77],"alternative":[78],"implement.":[80],"In":[81],"work,":[83],"we":[84],"present":[85],"an":[86],"efficient":[87],"heuristic":[88],"algorithm":[89,120,134],"based":[90],"on":[91],"PSO":[92],"metaheuristic":[93],"problem":[98],"small":[106],"searched":[107],"sequences":[108,142],"ones.":[111],"O(1).":[123],"experimental":[125],"results":[126],"showed":[127],"efficiency":[129],"proposed":[132],"search":[133],"finding":[136],"when":[143],"compared":[144],"two":[146],"other":[147],"algorithms.":[150]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}