{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T04:56:00Z","timestamp":1772772960837,"version":"3.50.1"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,7,20]],"date-time":"2014-07-20T00:00:00Z","timestamp":1405814400000},"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":["Neural Comput & Applic"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s00521-014-1659-0","type":"journal-article","created":{"date-parts":[[2014,7,19]],"date-time":"2014-07-19T09:05:27Z","timestamp":1405760727000},"page":"495-506","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["A memetic particle swarm optimization algorithm for solving the DNA fragment assembly problem"],"prefix":"10.1007","volume":"26","author":[{"given":"Ko-Wei","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jui-Le","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chu-Sing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-Wei","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,20]]},"reference":[{"key":"1659_CR1","doi-asserted-by":"crossref","unstructured":"Wang R-Y, Shi Z-Y, Guo Y-Y, Chen J-C, Chen G-Q (2013) DNA fragments assembly based on nicking enzyme system. PLoS One 8(3):e57943","DOI":"10.1371\/journal.pone.0057943"},{"key":"1659_CR2","unstructured":"Zhang Y, Fu B, Zhang X (2012) Dna cryptography based on DNA fragment assembly. In: Information science and digital content technology (ICIDT), 2012 8th international conference on, vol 1, pp 179\u2013182"},{"issue":"16","key":"1659_CR3","doi-asserted-by":"crossref","first-page":"3673","DOI":"10.1093\/nar\/8.16.3673","volume":"8","author":"R Staden","year":"1980","unstructured":"Staden R (1980) A new computer method for the storage and manipulation of DNA gel reading data. Nucleic Acids Res 8(16):3673\u20133694","journal-title":"Nucleic Acids Res"},{"issue":"4","key":"1659_CR4","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1016\/0022-2836(82)90546-0","volume":"162","author":"F Sanger","year":"1982","unstructured":"Sanger F, Coulson AR, Hong GF, Hill DF, Petersen GB (1982) Nucleotide sequence of bacteriophage lambda DNA. J Mol Biol 162(4):729\u201373","journal-title":"J Mol Biol"},{"key":"1659_CR5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.compbiolchem.2013.04.007","volume":"47","author":"AE Hassanien","year":"2013","unstructured":"Hassanien AE, Al-Shammari ET, Ghali NI (2013) Computational intelligence techniques in bioinformatics. Comput Biol Chem 47:37\u201347","journal-title":"Comput Biol Chem"},{"issue":"1","key":"1659_CR6","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"},{"key":"1659_CR7","unstructured":"Green P (1994) PHRAP. http:\/\/www.phrap.org"},{"issue":"9","key":"1659_CR8","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":"1659_CR9","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1093\/bioinformatics\/16.6.494","volume":"16","author":"T Chen","year":"2000","unstructured":"Chen T, Skiena SS (2000) A case study in genome-level fragment assembly. Bioinformatics 16:494\u2013500","journal-title":"Bioinformatics"},{"key":"1659_CR10","doi-asserted-by":"crossref","first-page":"4992","DOI":"10.1093\/nar\/23.24.4992","volume":"23","author":"JK Bonfield","year":"1995","unstructured":"Bonfield JK, Smith KF, Staden R (1995) A new DNA sequence assembly program. Nucleic Acids Res 23:4992\u20134999","journal-title":"Nucleic Acids Res"},{"key":"1659_CR11","doi-asserted-by":"crossref","unstructured":"Myers EW (2000) A whole-genome assembly of drosophila, pp 2196\u20132204","DOI":"10.1126\/science.287.5461.2196"},{"issue":"1","key":"1659_CR12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1101\/gr.208902","volume":"12","author":"S Batzoglou","year":"2002","unstructured":"Batzoglou S, Jaffe DB, Stanley K, Butler J, Gnerre S, Mauceli E, Berger B, Mesirov JP, Lander ES (2002) Arachne: a whole-genome shotgun assembler. Genome Res 12(1):177\u2013189","journal-title":"Genome Res"},{"key":"1659_CR13","doi-asserted-by":"crossref","unstructured":"Bocicor M, Czibula G, Czibula I (2011) A reinforcement learning approach for solving the fragment assembly problem. In: Symbolic and numeric algorithms for scientific computing (SYNASC), 2011 13th international symposium on, pp 191\u2013198","DOI":"10.1109\/SYNASC.2011.9"},{"issue":"4","key":"1659_CR14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.compbiolchem.2011.06.001","volume":"35","author":"Y Chang","year":"2011","unstructured":"Chang Y, Sahinidis NV (2011) An integer programming approach to DNA sequence assembly. Comput Biol Chem 35(4):251\u2013258","journal-title":"Comput Biol Chem"},{"key":"1659_CR15","doi-asserted-by":"crossref","unstructured":"Caserta M, Vo S (2014) A hybrid algorithm for the DNA sequencing problem. Discrete Appl Math 163 Part 1(0):87\u201399","DOI":"10.1016\/j.dam.2012.08.025"},{"key":"1659_CR16","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2022.001.0001","volume-title":"Computational molecular biology\u2014an algorithmic approach","author":"PA Pevzner","year":"2000","unstructured":"Pevzner PA (2000) Computational molecular biology\u2014an algorithmic approach. MIT Press, Cambridge, MA"},{"key":"1659_CR17","unstructured":"Schmitt KRB, Zimin AV, Marca\u00e7s G, Yorke JA, Girvan M (2013) A hierarchical network heuristic for solving the orientation problem in genome assembly. ArXiv e-prints"},{"key":"1659_CR18","volume-title":"Stochastic optimization tools for genomic sequence assembly. Automated DNA sequencing and analysis","author":"C Burks","year":"1994","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"},{"key":"1659_CR19","doi-asserted-by":"crossref","unstructured":"Alba E, Luque G, Khuri S (2005) Assembling DNA fragments with parallel algorithms. In: IEEE congress on evolutionary computation, vol 1, pp 57\u201364","DOI":"10.1109\/CEC.2005.1554667"},{"issue":"2","key":"1659_CR20","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0377-2217(99)00456-7","volume":"125","author":"J Baewicz","year":"2000","unstructured":"Baewicz J, Formanowicz P, Kasprzak M, Markiewicz WT, Wglarz J (2000) Tabu search for DNA sequencing with false negatives and false positives. Euro J Oper Res 125(2):257\u2013265","journal-title":"Euro J Oper Res"},{"issue":"1\u20132","key":"1659_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":"1659_CR22","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1166\/jctn.2005.004","volume":"2","author":"SC Fang","year":"2005","unstructured":"Fang SC, Wang Y, Zhong J (2005) A genetic algorithm approach to solving DNA fragment assembly problem. J Comput Theor Nanosci 2:499\u2013505","journal-title":"J Comput Theor Nanosci"},{"key":"1659_CR23","doi-asserted-by":"crossref","unstructured":"Kikuchi S, Chakraborty G (2006) Heuristically tuned GA to solve genome fragment assembly problem. In: IEEE congress on evolutionary computation, pp 1491\u20131498","DOI":"10.1109\/CEC.2006.1688485"},{"key":"1659_CR24","doi-asserted-by":"crossref","unstructured":"Alba E, Luque G (2008) A hybrid genetic algorithm for the dna fragment assembly problem. In: Recent advances in evolutionary computation for combinatorial optimization, pp 101\u2013112","DOI":"10.1007\/978-3-540-70807-0_7"},{"issue":"3","key":"1659_CR25","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"},{"issue":"9","key":"1659_CR26","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/978-3-642-22084-5_8","volume":"367","author":"G Luque","year":"2011","unstructured":"Luque G, Alba E (2011) Parallel gas in bioinformatics: assembling DNA fragments. Stud Comput Intell 367(9):135\u2013147","journal-title":"Stud Comput Intell"},{"key":"1659_CR27","doi-asserted-by":"crossref","unstructured":"Meksangsouy P, Chaiyaratana N (2003) DNA fragment assembly using an ant colony system algorithm. In: The congress on evolutionary computation, vol 3, 1756\u20131763","DOI":"10.1109\/CEC.2003.1299885"},{"key":"1659_CR28","doi-asserted-by":"crossref","unstructured":"Wetcharaporn W, Chaiyaratana N, Tongsima S (2006) DNA fragment assembly by ant colony and nearest neighbour heuristics. In: Proceedings 8th international conference artificial intelligence and soft computing, vol 4029","DOI":"10.1007\/11785231_106"},{"key":"1659_CR29","doi-asserted-by":"crossref","unstructured":"Ibrahim Z, Kurniawan TB (2009) Implementation of an ant colony system for DNA sequence optimization. J Artif Life Robot 293\u2013296","DOI":"10.1007\/s10015-009-0683-0"},{"key":"1659_CR30","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 fourteenth international conference on genetic and evolutionary computation conference, pp 201\u2013208","DOI":"10.1145\/2330163.2330192"},{"issue":"2","key":"1659_CR31","first-page":"49","volume":"8","author":"MZA Nazri","year":"2013","unstructured":"Nazri MZA, Huri MD, Bakar AA, Abdullah S, Dan AM, Kurniawan TB (2013) DNA sequence design using artificial immune systems. J Eng Appl Sci 8(2):49\u201357","journal-title":"J Eng Appl Sci"},{"key":"1659_CR32","doi-asserted-by":"crossref","unstructured":"Dorronsoro B, Bouvry P, Alba E (2010) Iterated local search for de novo genomic sequencing. In: Rutkowski L, Scherer R, Tadeusiewicz R, Zadeh L, Zurada JM (eds) Artificial intelligence and soft computing, volume 6114 of lecture notes in computer science. Springer, Berlin, pp 428\u2013436","DOI":"10.1007\/978-3-642-13232-2_52"},{"key":"1659_CR33","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, GECCO \u201910, pp 213\u2013214","DOI":"10.1145\/1830483.1830522"},{"issue":"4","key":"1659_CR34","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1587\/nolta.2.485","volume":"2","author":"T Kato","year":"2011","unstructured":"Kato T, Hasegawa M (2011) Performance of heuristic methods driven by chaotic dynamics for ATSP and applications to DNA fragment assembly. Nonlinear Theory Appl IEICE 2(4):485\u2013496","journal-title":"Nonlinear Theory Appl IEICE"},{"key":"1659_CR35","unstructured":"Luque G, Dorronsoro B, Alba E, Bouvry P (2008) A self-adaptive cellular memetic algorithm for the DNA fragment assembly problem. In: IEEE congress on evolutionary computation, pp 2651\u20132658"},{"key":"1659_CR36","doi-asserted-by":"crossref","unstructured":"Minetti G, Luque G, Alba E (2008) Variable neighborhood search as genetic algorithm operator for DNA fragment assembling problem. In: Eighth international conference on hybrid intelligent systems, pp 714\u2013719","DOI":"10.1109\/HIS.2008.182"},{"issue":"10","key":"1659_CR37","doi-asserted-by":"crossref","first-page":"12086","DOI":"10.1016\/j.eswa.2009.04.023","volume":"36","author":"S Nemati","year":"2009","unstructured":"Nemati S, Basiri ME, Ghasem-Aghaee N, Aghdam MH (2009) A novel acoga hybrid algorithm for feature selection in protein function prediction. Expert Syst Appl 36(10):12086\u201312094","journal-title":"Expert Syst Appl"},{"key":"1659_CR38","unstructured":"Minetti G, Leguizamon G, Alba E (2012) Sax: a new and efficient assembler for solving DNA fragment assembly problem. In: 13th Argentine symposium on artificial intelligence"},{"key":"1659_CR39","doi-asserted-by":"crossref","unstructured":"Minetti G, Leguizamn G, Alba E (2014) An improved trajectory-based hybrid metaheuristic applied to the noisy DNA fragment assembly problem. Inf Sci\u00a0277:273\u2013283","DOI":"10.1016\/j.ins.2014.02.020"},{"issue":"9","key":"1659_CR40","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 Oper Res 35(9):2776\u20132790","journal-title":"Comput Oper Res"},{"issue":"10","key":"1659_CR41","first-page":"33","volume":"28","author":"RS Verma","year":"2011","unstructured":"Verma RS, Singh V, Kumar S (2011) Article: DNA sequence assembly using particle swarm optimization. Int J Comput Appl 28(10):33\u201338","journal-title":"Int J Comput Appl"},{"key":"1659_CR42","unstructured":"Huang K-W, Chen J-L, Yang C-S (2012) A hybrid PSO-based algorithm for solving DNA fragment assembly problem. In: Third international conference on innovations in bio-inspired computing and applications, pp 223\u2013228"},{"key":"1659_CR43","doi-asserted-by":"crossref","unstructured":"Firoz JS, Rahman MS, Saha TK (2012) Hybrid meta-heuristics for DNA fragment assembly problem for noiseless data. In: Informatics, electronics vision (ICIEV), 2012 international conference on, pp 652\u2013656","DOI":"10.1109\/ICIEV.2012.6317502"},{"key":"1659_CR44","doi-asserted-by":"crossref","unstructured":"Mallen-Fullerton GM, Fernandez-Anaya G (2013) DNA fragment assembly using optimization. In: Evolutionary computation (CEC), 2013 IEEE congress on, pp 1570\u20131577","DOI":"10.1109\/CEC.2013.6557749"},{"issue":"11","key":"1659_CR45","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1038\/nbt.2023","volume":"29","author":"PEC Compeau","year":"2011","unstructured":"Compeau PEC, Pevzner PA, Tesler G (2011) How to apply de bruijn graphs to genome assembly. Nat Biotechnol 29(11):987\u2013991","journal-title":"Nat Biotechnol"},{"issue":"6","key":"1659_CR46","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ygeno.2010.03.001","volume":"95","author":"JR Miller","year":"2010","unstructured":"Miller JR, Koren S, Sutton G (2010) Assembly algorithms for next-generation sequencing data. Genomics 95(6):315\u2013327","journal-title":"Genomics"},{"issue":"1","key":"1659_CR47","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1093\/bfgp\/elr035","volume":"11","author":"Z Li","year":"2012","unstructured":"Li Z, Chen Y, Mu D, Yuan J, Shi Y, Zhang H, Gan J, Li N, Xuesong H, Liu B et al (2012) Comparison of the two major classes of assembly algorithms: overlap\u2013layout\u2013consensus and de-bruijn-graph. Brief Funct Genomics 11(1):25\u201337","journal-title":"Brief Funct Genomics"},{"issue":"17","key":"1659_CR48","doi-asserted-by":"crossref","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"PA Pevzner","year":"2001","unstructured":"Pevzner PA, Tang H, Waterman MS (2001) An Eulerian path approach to DNA fragment assembly. Proc Natl Acad Sci 98(17):9748\u201353","journal-title":"Proc Natl Acad Sci"},{"key":"1659_CR49","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1101\/gr.089532.108","volume":"19","author":"J Simpson","year":"2009","unstructured":"Simpson J, Wong K, Jackman S, Schein J, Jones S, Birol I (2009) Abyss: a parallel assembler for short read sequence data. Genome Res 19:1117","journal-title":"Genome Res"},{"issue":"3","key":"1659_CR50","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.bbrc.2012.08.101","volume":"426","author":"B Xu","year":"2012","unstructured":"Xu B, Gao J, Li C (2012) An efficient algorithm for DNA fragment assembly in mapreduce. Biochem Biophys Res Commun 426(3):395\u2013398","journal-title":"Biochem Biophys Res Commun"},{"key":"1659_CR51","doi-asserted-by":"crossref","unstructured":"Couto AD, Cerqueira FR, Guerra RL, Goncalves LB, Goulart CDC, Siqueira-Batista R, Ferreira RDS, Oliveira ADP (2012) Theoretical basis of a new method for DNA fragment assembly in k-mer graphs. In: Chilean computer science society (SCCC), 2012 31st international conference of the, pp 69\u201377","DOI":"10.1109\/SCCC.2012.16"},{"issue":"11","key":"1659_CR52","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1093\/bioinformatics\/bts175","volume":"28","author":"AA Gritsenko","year":"2012","unstructured":"Gritsenko AA, Nijkamp JF, Reinders MJT, de Ridder D (2012) Grass: a generic algorithm for scaffolding next-generation sequencing assemblies. Bioinformatics 28(11):1429\u20131437","journal-title":"Bioinformatics"},{"key":"1659_CR53","doi-asserted-by":"crossref","unstructured":"Hassan H, Majid ZA, Halim AK, Ibrahim A (2013) Design and development of DNA fragment assembly using IWP method. In: Control and system graduate research colloquium (ICSGRC), 2013 IEEE 4th, pp 63\u201368","DOI":"10.1109\/ICSGRC.2013.6653277"},{"key":"1659_CR54","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu Search. Kluwer, Norwell, MA"},{"key":"1659_CR55","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"issue":"11","key":"1659_CR56","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic N (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"3","key":"1659_CR57","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.rcim.2003.09.001","volume":"20","author":"R Swarnkar","year":"2004","unstructured":"Swarnkar R, Tiwari MK (2004) Modeling machine loading problem of FMSs and its solution methodology using a hybrid tabu search and simulated annealing-based heuristic approach. Robot Comput Integr Manuf 20(3):199\u2013209","journal-title":"Robot Comput Integr Manuf"},{"issue":"6","key":"1659_CR58","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21(6):1087\u20131092","journal-title":"J Chem Phys"},{"issue":"3","key":"1659_CR59","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1109\/TEVC.2007.900837","volume":"12","author":"S Bandyopadhyay","year":"2008","unstructured":"Bandyopadhyay S, Saha S, Maulik U, Deb K (2008) A simulated annealing-based multiobjective optimization algorithm: AMOSA. IEEE Trans Evol Comput 12(3):269\u2013283","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"1659_CR60","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/TSMCB.2006.883272","volume":"37","author":"B Liu","year":"2007","unstructured":"Liu B, Wang L, Jin Y-H (2007) An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Trans Syst Man Cybern Part B Cybern 37(1):18\u201327","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"issue":"3","key":"1659_CR61","doi-asserted-by":"crossref","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"MF Tasgetiren","year":"2007","unstructured":"Tasgetiren MF, Liang Y-C, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177(3):1930\u20131947","journal-title":"Eur J Oper Res"},{"key":"1659_CR62","doi-asserted-by":"crossref","unstructured":"Gendreau M, Potvin J-Y (2010) Handbook of metaheuristics, 2nd edn. Springer Publishing Company, Berlin\u00a0","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"1659_CR63","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE international conference on neural networks, vol 4, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"1659_CR64","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: IEEE international conference on systems, man, and cybernetics, vol 5, pp 4104\u20134108","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"1659_CR65","doi-asserted-by":"crossref","unstructured":"Shi Y, Eberhart R (1998) A modified particle swarm optimizer. In: Proceedings of IEEE international conference on evolutionary computation, pp 69\u201373","DOI":"10.1109\/ICEC.1998.699146"},{"issue":"8","key":"1659_CR66","doi-asserted-by":"crossref","first-page":"4116","DOI":"10.1016\/j.csda.2008.01.022","volume":"52","author":"SE Coull","year":"2008","unstructured":"Coull SE, Szymanski BK (2008) Sequence alignment for masquerade detection. Comput Stat Data Anal 52(8):4116\u20134131","journal-title":"Comput Stat Data Anal"},{"issue":"2","key":"1659_CR67","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6(2):154\u2013160","journal-title":"ORSA J Comput"},{"key":"1659_CR68","doi-asserted-by":"crossref","unstructured":"Onwubolu GC, Davendra D (2009) Differential evolution: a handbook for global permutation-based combinatorial optimization. Springer Publishing Company, Berlin\u00a0","DOI":"10.1007\/978-3-540-92151-6"},{"issue":"1","key":"1659_CR69","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":"1659_CR70","unstructured":"Yang C-S, Chuang L-Y, Ke C-H, Yang C-S (2008) Comparative particle swarm optimization (CPSO) for solving optimization problems. In: Research, innovation and vision for the future, 2008. RIVF 2008. IEEE international conference on, pp 86\u201390"},{"issue":"13","key":"1659_CR71","doi-asserted-by":"crossref","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232\u20132248","journal-title":"Inf Sci"},{"key":"1659_CR72","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garca S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1:3\u201318","journal-title":"Swarm Evol Comput"},{"issue":"5","key":"1659_CR73","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TEVC.2011.2160399","volume":"15","author":"Z Zhu","year":"2011","unstructured":"Zhu Z, Zhou J, Ji Z, Shi Y (2011) DNA sequence compression using adaptive particle swarm optimization-based memetic algorithm. IEEE Trans Evol Comput 15(5):643\u2013658","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"1659_CR74","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1109\/TEVC.2010.2052054","volume":"15","author":"Z-H Zhan","year":"2011","unstructured":"Zhan Z-H, Zhang J, Li Y, Shi Y (2011) Orthogonal learning particle swarm optimization. IEEE Trans Evol Comput 15(6):832\u2013847","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1659_CR75","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.swevo.2011.06.003","volume":"1","author":"J Senthilnath","year":"2011","unstructured":"Senthilnath J, Omkar SN, Mani V (2011) Clustering using firefly algorithm: performance study. Swarm Evol Comput 1(3):164\u2013171","journal-title":"Swarm Evol Comput"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-014-1659-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-014-1659-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-014-1659-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T21:01:25Z","timestamp":1565643685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-014-1659-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,20]]},"references-count":75,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["1659"],"URL":"https:\/\/doi.org\/10.1007\/s00521-014-1659-0","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,20]]}}}