{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:25:02Z","timestamp":1758273902515},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,10,12]],"date-time":"2015-10-12T00:00:00Z","timestamp":1444608000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s00500-015-1875-2","type":"journal-article","created":{"date-parts":[[2015,10,12]],"date-time":"2015-10-12T19:34:50Z","timestamp":1444678490000},"page":"1709-1720","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An improved problem aware local search algorithm for the DNA fragment assembly problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Abdelkamel","family":"Ben Ali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Luque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrique","family":"Alba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamal E.","family":"Melkemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,12]]},"reference":[{"key":"1875_CR1","unstructured":"Alba E, Dorronsoro B (2009) Cellular genetic algorithms, vol\u00a042, chap 15\u2014Bioinformatics: The DNA fragment assembly problem. Springer, Berlin, pp 203\u2013210"},{"key":"1875_CR2","doi-asserted-by":"crossref","unstructured":"Alba E, Luque G (2007) A new local search algorithm for the DNA fragment assembly problem. In: Cotta C, van Hemert J (eds) Evolutionary computation in combinatorial optimization: EvoCOP\u201907, LNCS, vol 4446, Springer, Valencia, Spain, pp 1\u201312","DOI":"10.1007\/978-3-540-71615-0_1"},{"key":"1875_CR3","doi-asserted-by":"crossref","unstructured":"Alba E, Luque G (2008) A hybrid genetic algorithm for the dna fragment assembly problem. In: Cotta C, van Hemert J (eds) Recent Advances in Evolutionary Computation for Combinatorial Optimization, Studies in Computational Intelligence, vol 153, Springer, pp 101\u2013112","DOI":"10.1007\/978-3-540-70807-0_7"},{"key":"1875_CR4","doi-asserted-by":"crossref","unstructured":"Burks C, Engle M, Forrest S, Parsons R, Soderlund C, Stolorz P (1994) Stochastic optimization tools for genomic sequence assembly. Automated DNA sequencing and analysis. Academic Press, London, pp 249\u2013259","DOI":"10.1016\/B978-0-08-092639-1.50038-1"},{"key":"1875_CR5","doi-asserted-by":"crossref","unstructured":"Chen T, Skiena SS (1997) Trie-based data structures for sequence assembly. In: Proceedings of the 8th annual symposium on combinatorial pattern matching. Springer, Berlin, pp 206\u2013223","DOI":"10.1007\/3-540-63220-4_61"},{"key":"1875_CR6","doi-asserted-by":"crossref","unstructured":"Dorronsoro B, Alba E, Luque G, Bouvry P (2008) A self-adaptive cellular memetic algorithm for the DNA fragment assembly problem. In: Proceedings of IEEE congress on evolutionary computation, pp 2651\u20132658","DOI":"10.1109\/CEC.2008.4631154"},{"issue":"1","key":"1875_CR7","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1006\/geno.1993.1180","volume":"16","author":"ML Engle","year":"1993","unstructured":"Engle ML, Burks C (1993) Artificially generated data sets for testing DNA sequence assembly algorithms. Genomics 16(1):286\u2013288","journal-title":"Genomics"},{"key":"1875_CR8","doi-asserted-by":"crossref","unstructured":"Firoz JS, Rahman MS, Saha TK (2012) Bee algorithms for solving DNA fragment assembly problem with noisy and noiseless data. In: Proceedings of the 14th annual conference on genetic and evolutionary computation, ACM, New York, pp 201\u2013208","DOI":"10.1145\/2330163.2330192"},{"key":"1875_CR9","unstructured":"Green P (1994) Phrap, http:\/\/www.phrap.org"},{"issue":"3","key":"1875_CR10","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s00521-014-1659-0","volume":"26","author":"KW Huang","year":"2015","unstructured":"Huang KW, Chen JL, Yang CS, Tsai CW (2015) A memetic particle swarm optimization algorithm for solving the DNA fragment assembly problem. Neural Comput Appl 26(3):495\u2013506","journal-title":"Neural Comput Appl"},{"issue":"9","key":"1875_CR11","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1101\/gr.9.9.868","volume":"9","author":"X Huang","year":"1999","unstructured":"Huang X, Madan A (1999) CAP3: a DNA sequence assembly program. Genome Res 9(9):868\u2013877","journal-title":"Genome Res"},{"key":"1875_CR12","doi-asserted-by":"crossref","unstructured":"Kubalik J, Buryan P, Wagner L (2010) Solving the DNA fragment assembly problem efficiently using iterative optimization with evolved hypermutations. In: Proceedings of the 12th annual conference on Genetic and evolutionary computation, ACM, New York, pp 213\u2013214","DOI":"10.1145\/1830483.1830522"},{"key":"1875_CR13","unstructured":"Li L, Khuri S (2004) A comparison of DNA fragment assembly algorithms. METMBS 4:329\u2013335"},{"key":"1875_CR14","doi-asserted-by":"crossref","unstructured":"Luque G, Alba E, Khuri S (2006) Parallel Algorithms for bioinformatics. Assembling DNA fragments with a distributed genetic algorithm, chapter 16. Wiley, New York","DOI":"10.1002\/0471756504.ch12"},{"issue":"6","key":"1875_CR15","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1504\/IJBIC.2013.058912","volume":"5","author":"GM Mall\u00e9n-Fullerton","year":"2013","unstructured":"Mall\u00e9n-Fullerton GM, Hughes JA, Houghten S, Fern\u00e1ndez-Anaya G (2013) Benchmark datasets for the DNA fragment assembly problem. Int J Bio-Inspired Comput 5(6):384\u2013394","journal-title":"Int J Bio-Inspired Comput"},{"key":"1875_CR16","doi-asserted-by":"crossref","unstructured":"Meksangsouy P, Chaiyaratana N (2003) DNA fragment assembly using an ant colony system algorithm. In: Evolutionary computation, 2003. CEC\u201903. The 2003 Congress, IEEE, vol\u00a03, pp 1756\u20131763","DOI":"10.1109\/CEC.2003.1299885"},{"issue":"3","key":"1875_CR17","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.ipl.2008.04.005","volume":"108","author":"G Minetti","year":"2008","unstructured":"Minetti G, Alba E, Luque G (2008) Seeding strategies and recombination operators for solving the DNA fragment assembly problem. Inf Process Lett 108(3):94\u2013100","journal-title":"Inf Process Lett"},{"key":"1875_CR18","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.ins.2014.02.020","volume":"277","author":"G Minetti","year":"2014","unstructured":"Minetti G, Leguizam\u00f3n G, Alba E (2014) An improved trajectory-based hybrid metaheuristic applied to the noisy DNA fragment assembly problem. Inf Sci 277:273\u2013283","journal-title":"Inf Sci"},{"issue":"2","key":"1875_CR19","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1089\/cmb.1995.2.275","volume":"2","author":"EW Myers","year":"1995","unstructured":"Myers EW (1995) Toward simplifying and accurately formulating fragment assembly. J Comput Biol 2(2):275\u2013290","journal-title":"J Comput Biol"},{"issue":"9","key":"1875_CR20","doi-asserted-by":"crossref","first-page":"2776","DOI":"10.1016\/j.cor.2006.12.011","volume":"35","author":"AJ Nebro","year":"2008","unstructured":"Nebro AJ, Luque G, Luna F, Alba E (2008) DNA fragment assembly using a grid-based genetic algorithm. Comput Op Res 35(9):2776\u20132790","journal-title":"Comput Op Res"},{"issue":"1\u20132","key":"1875_CR21","first-page":"11","volume":"21","author":"RJ Parsons","year":"1995","unstructured":"Parsons RJ, Forrest S, Burks C (1995) Genetic algorithms, operators, and DNA fragment assembly. Mach Learn 21(1\u20132):11\u201333","journal-title":"Mach Learn"},{"key":"1875_CR22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2022.001.0001","volume-title":"Computational molecular biology: an algorithmic approach","author":"P Pevzner","year":"2000","unstructured":"Pevzner P (2000) Computational molecular biology: an algorithmic approach. MIT Press, Cambridge"},{"key":"1875_CR23","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0065-2458(03)60006-9","volume":"60","author":"M Pop","year":"2004","unstructured":"Pop M (2004) Shotgun sequence assembly. Adv Comput 60:193\u2013248","journal-title":"Adv Comput"},{"key":"1875_CR24","unstructured":"Setubal JC, Meidanis J (1997) Introduction to computational molecular biology. Fragment assembly of DNA, Chap 4. University of Campinas, Brazil, pp 105\u2013139"},{"issue":"1","key":"1875_CR25","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1089\/gst.1995.1.9","volume":"1","author":"GG Sutton","year":"1995","unstructured":"Sutton GG, White O, Adams MD, Kerlavage AR (1995) TIGR assembler: a new tool for assembling large shotgun sequencing projects. Genome Sci Technol 1(1):9\u201319","journal-title":"Genome Sci Technol"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1875-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1875-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1875-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1875-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T07:29:51Z","timestamp":1567236591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1875-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,12]]},"references-count":25,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["1875"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1875-2","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,12]]}}}