{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:34:30Z","timestamp":1758274470962,"version":"3.40.5"},"reference-count":0,"publisher":"IGI Global","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,4,1]]},"abstract":"<p>DNA Fragment Assembly (DFA) is a process of finding the best order and orientation of a set of DNA fragments to reconstruct the original DNA sequence from them. As it has to consider all possible combinations among the DNA fragments, it is considered as a combinatorial optimisation problem. This paper presents a method showing the use of Penguins Search Optimisation Algorithm (PeSOA) for DNA fragment assembly problem. Penguins search optimisation is a nature inspired metaheuristic algorithm based on the collaborative hunting strategy of penguins. The approach starts its operation by generating a set of random population. After that, the population is divided into several groups, and each group contains a set of active fragments in which the penguins concentrate on the search process. The search process of the penguin optimisation algorithm is controlled by the oxygen reserve of penguins. During the search process each penguin shares its best found solution with other penguins to quickly converge to the global optimum. In this paper, the authors adapted the original PeSOA algorithm to obtain a new algorithm structure for DNA assembly problem. The effectiveness of the proposed approach has been verified by applying it on the well-known benchmarks for the DNA assembly problem. The results show that the proposed method performed well compared to the most used DNA fragment assembly methods.<\/p>","DOI":"10.4018\/ijamc.2016040104","type":"journal-article","created":{"date-parts":[[2016,7,18]],"date-time":"2016-07-18T17:49:57Z","timestamp":1468864197000},"page":"58-70","source":"Crossref","is-referenced-by-count":3,"title":["Pe-DFA"],"prefix":"10.4018","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0854-5211","authenticated-orcid":true,"given":"Youcef","family":"Gheraibia","sequence":"first","affiliation":[{"name":"Department of Computer Science and Mathematics, University of Mohammed Cherif Messaadia, Souk Ahras, Algeria and Department of Computer Science, University of Badji Mokhtar, Annaba, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelouahab","family":"Moussaoui","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Ferhat Abaas, Setif, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sohag","family":"Kabir","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Hull, Hull, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Smaine","family":"Mazouzi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Skikda, Skikda, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2432","container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=159899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T23:57:38Z","timestamp":1654127858000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJAMC.2016040104"}},"subtitle":["Penguins Search Optimisation Algorithm for DNA Fragment Assembly"],"short-title":[],"issued":{"date-parts":[[2016,4,1]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"URL":"https:\/\/doi.org\/10.4018\/ijamc.2016040104","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"type":"print","value":"1947-8283"},{"type":"electronic","value":"1947-8291"}],"subject":[],"published":{"date-parts":[[2016,4,1]]}}}