{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:56:54Z","timestamp":1764997014840,"version":"3.46.0"},"reference-count":0,"publisher":"Walter de Gruyter GmbH","issue":"3","license":[{"start":{"date-parts":[[2014,6,17]],"date-time":"2014-06-17T00:00:00Z","timestamp":1402963200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,9,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Multiple sequence alignment (MSA) is one of the major problems that can be encountered in the bioinformatics field. MSA consists in aligning a set of biological sequences to extract the similarities between them. Unfortunately, this problem has been shown to be NP-hard. In this article, a new algorithm was proposed to deal with this problem; it is based on a quantum-inspired cuckoo search algorithm. The other feature of the proposed approach is the use of a randomized progressive alignment method based on a hybrid global\/local pairwise algorithm to construct the initial population. The results obtained by this hybridization are very encouraging and show the feasibility and effectiveness of the proposed solution.<\/jats:p>","DOI":"10.1515\/jisys-2013-0052","type":"journal-article","created":{"date-parts":[[2014,6,17]],"date-time":"2014-06-17T10:29:23Z","timestamp":1403000963000},"page":"261-275","source":"Crossref","is-referenced-by-count":10,"title":["A New Quantum Cuckoo Search Algorithm for Multiple Sequence Alignment"],"prefix":"10.1515","volume":"23","author":[{"given":"Widad","family":"Kartous","sequence":"first","affiliation":[{"name":"MISC Laboratory, Department of Computer Science and its applications, University of Constantine 2, Nouvelle Ville Ali Mendjeli - BP: 67A, 25000, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdesslem","family":"Layeb","sequence":"additional","affiliation":[{"name":"MISC Laboratory, Department of Computer Science and its applications, University of Constantine 2, Nouvelle Ville Ali Mendjeli - BP: 67A, 25000, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salim","family":"Chikhi","sequence":"additional","affiliation":[{"name":"MISC Laboratory, Department of Computer Science and its applications, University of Constantine 2, Nouvelle Ville Ali Mendjeli - BP: 67A, 25000, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2014,6,17]]},"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jisys\/23\/3\/article-p261.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2013-0052\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2013-0052\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T17:18:20Z","timestamp":1764955100000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2013-0052\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,17]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2014,6,17]]},"published-print":{"date-parts":[[2014,9,1]]}},"alternative-id":["10.1515\/jisys-2013-0052"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2013-0052","relation":{},"ISSN":["2191-026X","0334-1860"],"issn-type":[{"type":"electronic","value":"2191-026X"},{"type":"print","value":"0334-1860"}],"subject":[],"published":{"date-parts":[[2014,6,17]]}}}