{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:37:23Z","timestamp":1777703843576,"version":"3.51.4"},"reference-count":76,"publisher":"SAGE Publications","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2016,3,10]]},"DOI":"10.3233\/ifs-151994","type":"journal-article","created":{"date-parts":[[2016,3,16]],"date-time":"2016-03-16T13:50:32Z","timestamp":1458136232000},"page":"2245-2255","source":"Crossref","is-referenced-by-count":9,"title":["A memetic gravitation search algorithm for solving DNA fragment assembly problems"],"prefix":"10.1177","volume":"30","author":[{"given":"Ko-Wei","family":"Huang","sequence":"first","affiliation":[{"name":"Institute of Computer and Communication Engineering, Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan, R.O.C."},{"name":"Department of Psychology, National Cheng Kung University, Tainan, Taiwan, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jui-Le","family":"Chen","sequence":"additional","affiliation":[{"name":"Institute of Computer and Communication Engineering, Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan, R.O.C."},{"name":"Department of Computer Science and Entertainment Technology, Tajen university, Pingtung, Taiwan, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chu-Sing","family":"Yang","sequence":"additional","affiliation":[{"name":"Institute of Computer and Communication Engineering, Department of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-Wei","family":"Tsai","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Ilan University, Yilan, Taiwan, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/IFS-151994_ref1","first-page":"179","volume":"volume 1","author":"Zhang","year":"2012","journal-title":"Dna cryptography based on DNA\u00a0fragment assembly"},{"issue":"3","key":"10.3233\/IFS-151994_ref2","doi-asserted-by":"crossref","first-page":"e57943","DOI":"10.1371\/journal.pone.0057943","article-title":"DNA fragments assembly based on nicking enzyme system","volume":"8","author":"Wang","year":"2013","journal-title":"PLoS One"},{"key":"10.3233\/IFS-151994_ref3","doi-asserted-by":"crossref","unstructured":"Pevzner P.A. , Computational molecular biology - an algorithmic approach, MIT Press, 2000.","DOI":"10.7551\/mitpress\/2022.001.0001"},{"issue":"4","key":"10.3233\/IFS-151994_ref4","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1587\/nolta.2.485","article-title":"Performance of heuristic methods driven by chaotic dynamics for atsp and applications to DNA fragment assembly","volume":"2","author":"Kato","year":"2011","journal-title":"Nonlinear Theory and Its Applications, IEICE"},{"issue":"4","key":"10.3233\/IFS-151994_ref5","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1016\/0022-2836(82)90546-0","article-title":"Nucleotide sequence of bacteriophage lambda DNA","volume":"162","author":"Sanger","year":"1982","journal-title":"Journal of Molecular Biology"},{"key":"10.3233\/IFS-151994_ref6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.compbiolchem.2013.04.007","article-title":"Computational intelligence techniques in bioinformatics","volume":"47","author":"Hassanien","year":"2013","journal-title":"Computational Biology and Chemistry"},{"key":"10.3233\/IFS-151994_ref8","doi-asserted-by":"crossref","first-page":"4992","DOI":"10.1093\/nar\/23.24.4992","article-title":"A new DNA sequence assembly program","volume":"23","author":"Bonfield","year":"1995","journal-title":"Nucleic Acids Res"},{"issue":"1","key":"10.3233\/IFS-151994_ref9","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1089\/gst.1995.1.9","article-title":"Tigr assembler: A new tool for asbling large shotgun sequencing projects","volume":"1","author":"Sutton","year":"1995","journal-title":"Genome Science and Technology"},{"issue":"9","key":"10.3233\/IFS-151994_ref10","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1101\/gr.9.9.868","article-title":"Cap3: A dna sequence assembly program","volume":"9","author":"Huang","year":"1999","journal-title":"Genome Research"},{"key":"10.3233\/IFS-151994_ref11","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1093\/bioinformatics\/16.6.494","article-title":"A case study in genome-level fragment assembly","volume":"16","author":"Chen","year":"2000","journal-title":"Bioinformatics"},{"key":"10.3233\/IFS-151994_ref12","doi-asserted-by":"crossref","unstructured":"Myers E.W. , A whole-genome assembly of drosophila, 2000, pp. 2196\u20132204.","DOI":"10.1126\/science.287.5461.2196"},{"issue":"1","key":"10.3233\/IFS-151994_ref13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1101\/gr.208902","article-title":"Arachne: A whole-genome shotgun assembler","volume":"12","author":"Batzoglou","year":"2002","journal-title":"Genome Res"},{"key":"10.3233\/IFS-151994_ref14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-1665-5","volume-title":"Handbook of Metaheuristics","author":"Gendreau","year":"2010"},{"key":"10.3233\/IFS-151994_ref15","unstructured":"Schmitt K.R.B. , Zimin A.V. , Marca\u00e7s G. , Yorke J.A. and Girvan M. , A hierarchical network heuristic for solving the orientation problem in genome assembly, ArXiv E-Prints (2013)."},{"key":"10.3233\/IFS-151994_ref16","doi-asserted-by":"crossref","unstructured":"Alba E. , Luque G. and Khuri S. , Assembling DNA fragments with parallel algorithms. In IEEE Congress on Evolutionary Computation, volume 1, 2005, pp. 57\u201364.","DOI":"10.1109\/CEC.2005.1554667"},{"key":"10.3233\/IFS-151994_ref17","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.ins.2014.02.020","article-title":"An improved trajectory-based hybrid metaheuristic applied to the noisy DNA fragment assembly problem","author":"Minetti","year":"2014","journal-title":"Information Sciences"},{"issue":"2","key":"10.3233\/IFS-151994_ref18","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0377-2217(99)00456-7","article-title":"Tabu search for DNA sequencing with false negatives and false positives","volume":"125","author":"Baewicz","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.3233\/IFS-151994_ref19","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1166\/jctn.2005.2974","article-title":"A genetic algorithm approach to solving DNA fragment assembly problem","volume":"2","author":"Wang","year":"2005","journal-title":"Journal of Computational and Theoretical Nanoscience"},{"key":"10.3233\/IFS-151994_ref20","doi-asserted-by":"crossref","unstructured":"Alba E. and Luque G. , A hybrid genetic algorithm for the dna fragment assembly problem. In Recent Advances in Evolutionary Computation for Combinatorial Optimization, 2008, pp. 101\u2013112.","DOI":"10.1007\/978-3-540-70807-0_7"},{"issue":"3","key":"10.3233\/IFS-151994_ref21","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.ipl.2008.04.005","article-title":"Seeding strategies and recombination operators for solving the DNA fragment assembly problem","volume":"108","author":"Minetti","year":"2008","journal-title":"Information Processing Letters"},{"issue":"9","key":"10.3233\/IFS-151994_ref22","first-page":"135","article-title":"Parallel gas in bioinformatics: Assembling DNA fragments","volume":"367","author":"Luque","year":"2011","journal-title":"Studies in Computational Intelligence"},{"key":"10.3233\/IFS-151994_ref23","doi-asserted-by":"crossref","unstructured":"Hughes J. , Houghten S. , Mallen-Fullerton G.M. and Ashlock D. , Recentering and restarting genetic algorithm variations for dna fragment assembly. In Computational Intelligence in Bioinformatics and Computational Biology, 2014 IEEE Conference on, 2014, pp. 1\u20138.","DOI":"10.1109\/CIBCB.2014.6845500"},{"key":"10.3233\/IFS-151994_ref24","unstructured":"Hughes J. , A study of ordered gene problems featuring dna error correction and dna fragment assembly with a variety of heuristics, genetic algorithm variations, and dynamic representations, 2014."},{"issue":"3","key":"10.3233\/IFS-151994_ref25","doi-asserted-by":"crossref","first-page":"84","DOI":"10.4018\/ijaec.2014070105","article-title":"Dna fragment assembly using multi-objective genetic algorithms","volume":"5","author":"Rathee","year":"2014","journal-title":"International Journal of Applied Evolutionary Computation"},{"key":"10.3233\/IFS-151994_ref26","doi-asserted-by":"crossref","unstructured":"Wetcharaporn W. , Chaiyaratana N. and Tongsima S. , DNA fragment assembly by ant colony and nearest neighbour heuristics, In Proceedings 8th International Conference Artificial Intelligence and Soft Computing, volume 4029, 2006.","DOI":"10.1007\/11785231_106"},{"key":"10.3233\/IFS-151994_ref27","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10015-009-0683-0","article-title":"Implementation of an ant colony system for DNA sequence optimization","author":"Ibrahim","year":"2009","journal-title":"Journal of Artif Life Robotics"},{"issue":"2","key":"10.3233\/IFS-151994_ref28","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10489-015-0650-5","article-title":"A novel locally guided genome reassembling technique using an artificial ant system","volume":"43","author":"Baidya","year":"2015","journal-title":"Applied Intelligence"},{"key":"10.3233\/IFS-151994_ref29","doi-asserted-by":"crossref","unstructured":"Firoz J.S. , Rahman M.S. and Saha T.K. , 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, 2012, pp. 201\u2013208.","DOI":"10.1145\/2330163.2330192"},{"issue":"10","key":"10.3233\/IFS-151994_ref30","doi-asserted-by":"crossref","first-page":"33","DOI":"10.5120\/3425-4777","article-title":"Dna sequence assembly using particle swarm optimization","volume":"28","author":"Verma","year":"2011","journal-title":"International Journal of Computer Applications"},{"key":"10.3233\/IFS-151994_ref31","doi-asserted-by":"crossref","unstructured":"Firoz J.S. , Rahman M.S. and Saha T.K. , Hybrid metaheuristics for DNA fragment assembly problem for noiseless data. In Informatics, Electronics Vision (ICIEV), 2012 International Conference on, 2012, pp. 652\u2013656.","DOI":"10.1109\/ICIEV.2012.6317502"},{"key":"10.3233\/IFS-151994_ref32","doi-asserted-by":"crossref","unstructured":"Mall\u00e9n-Fullerton G.M. and Fernandez-Anaya G., DNA fragment asbly using optimization. In Evolutionary Computation (CEC), 2013 IEEE Congress on, 2013, pp. 1570\u20131577.","DOI":"10.1109\/CEC.2013.6557749"},{"key":"10.3233\/IFS-151994_ref33","first-page":"1","article-title":"A memetic particle swarm optimization algorithm for solving the dna fragment assembly problem, pp","author":"Huang","year":"2014","journal-title":"Neural Computing and Applications"},{"issue":"1","key":"10.3233\/IFS-151994_ref34","doi-asserted-by":"crossref","first-page":"97","DOI":"10.2174\/1574893609666140301001642","article-title":"An adaptive particle swarm optimization algorithm for solving dna fragment assembly problem","volume":"10","author":"Rajagopal","year":"2015","journal-title":"Current Bioinformatics"},{"issue":"2","key":"10.3233\/IFS-151994_ref35","first-page":"49","article-title":"DNA sequence design using artificial immune systems","volume":"8","author":"Nazri","year":"2013","journal-title":"Journal of Engineering and Applied Sciences"},{"key":"10.3233\/IFS-151994_ref36","first-page":"117","article-title":"Improved cuckoo search algorithm for dna fragment assembly problem","author":"Kartous","year":"2015","journal-title":"Networking and Advanced Systems"},{"issue":"1","key":"10.3233\/IFS-151994_ref37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12046-014-0300-3","article-title":"Nature-inspired novel cuckoo search algorithm for genome sequence assembly","volume":"40","author":"Indumathy","year":"2015","journal-title":"Sadhana"},{"key":"10.3233\/IFS-151994_ref38","unstructured":"Vidal P. and Olivera A. , A parallel discrete firefly algorithm on gpu for permutation combinatorial optimization problems, 485 (2014), 191\u2013205."},{"issue":"9","key":"10.3233\/IFS-151994_ref39","doi-asserted-by":"crossref","first-page":"2776","DOI":"10.1016\/j.cor.2006.12.011","article-title":"DNA fragment assembly using a grid-based genetic algorithm","volume":"35","author":"Nebro","year":"2008","journal-title":"Computers & Operations Research"},{"key":"10.3233\/IFS-151994_ref40","first-page":"2651","article-title":"A self-adaptive cellular memetic algorithm for the DNA fragment assembly problem","author":"Luque","year":"2008","journal-title":"In IEEE Congress on Evolutionary Computation"},{"issue":"10","key":"10.3233\/IFS-151994_ref41","doi-asserted-by":"crossref","first-page":"12086","DOI":"10.1016\/j.eswa.2009.04.023","article-title":"A novel acoga hybrid algorithm for feature selection in protein function prediction","volume":"36","author":"Nemati","year":"2009","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/IFS-151994_ref42","first-page":"428","volume-title":"Artifical Intelligence and Soft Computing, volume 6114 of Lecture Notes in Computer Science","author":"Dorronsoro","year":"2010"},{"key":"10.3233\/IFS-151994_ref43","doi-asserted-by":"crossref","unstructured":"Kubalik J. , Buryan P. and Wagner L. , 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, 2010, pp. 213\u2013214.","DOI":"10.1145\/1830483.1830522"},{"issue":"6","key":"10.3233\/IFS-151994_ref44","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1504\/IJBIC.2013.058912","article-title":"Benchmark datasets for the dna fragment assembly problem","volume":"5","author":"Mall\u00e9n-Fullerton","year":"2013","journal-title":"International Journal of Bio-Inspired Computation"},{"issue":"11","key":"10.3233\/IFS-151994_ref45","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1038\/nbt.2023","article-title":"How to apply de bruijn graphs to genome assembly","volume":"29","author":"Compeau","year":"2011","journal-title":"Nature Biotechnology"},{"issue":"6","key":"10.3233\/IFS-151994_ref46","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ygeno.2010.03.001","article-title":"Assembly algorithms for next-generation sequencing data","volume":"95","author":"Miller","year":"2010","journal-title":"Genomics"},{"issue":"1","key":"10.3233\/IFS-151994_ref47","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1093\/bfgp\/elr035","article-title":"Comparison of the two major classes of assembly algorithms: overlap-layout-consensus and de-bruijn-graph","volume":"11","author":"Li","year":"2012","journal-title":"Briefings in Functional Genomics"},{"issue":"17","key":"10.3233\/IFS-151994_ref48","doi-asserted-by":"crossref","first-page":"9748","DOI":"10.1073\/pnas.171285098","article-title":"An eulerian path approach to DNA fragment assembly","volume":"98","author":"Pevzner","year":"2001","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"10.3233\/IFS-151994_ref49","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1101\/gr.089532.108","article-title":"Abyss: A parallel assembler for short read sequence data","volume":"19","author":"Simpson","year":"2009","journal-title":"Genome Res"},{"key":"10.3233\/IFS-151994_ref50","doi-asserted-by":"crossref","unstructured":"Georganas E. , Buluc A. , Chapman J. , Oliker L. , Rokhsar D. and Yelick K. , Parallel de bruijn graph construction and traversal for de novo genome assembly, In High Performance Computing, Networking, Storage and Analysis, SC14: International Conference for, 2014, pp. 437\u2013448.","DOI":"10.1109\/SC.2014.41"},{"key":"10.3233\/IFS-151994_ref51","doi-asserted-by":"crossref","unstructured":"Couto A.D. , Ribeiro Cerqueira F. , Guerra R.L., Goncalves L.B., De Castro Goulart C., Siqueira-Batista R., Dos Santos Ferreira R. and De Paiva Oliveira A., 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, 2012, pp. 69\u201377.","DOI":"10.1109\/SCCC.2012.16"},{"key":"10.3233\/IFS-151994_ref52","doi-asserted-by":"crossref","unstructured":"Zhao K. , Liu W. , Voss G. and Muller-Wittig W. , A dynamic hashing approach to build the de bruijn graph for genome assembly. In TENCON 2013 - 2013 IEEE Region 10 Conference, 2013, pp. 1\u20134.","DOI":"10.1109\/TENCON.2013.6719008"},{"issue":"12","key":"10.3233\/IFS-151994_ref53","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1093\/bioinformatics\/btu266","article-title":"Exspander: A universal repeat resolver for dna fragment assembly","volume":"30","author":"Prjibelski","year":"2014","journal-title":"Bioinformatics"},{"issue":"11","key":"10.3233\/IFS-151994_ref54","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1093\/bioinformatics\/bts175","article-title":"Grass: A generic algorithm for scaffolding next-generation sequencing assemblies","volume":"28","author":"Gritsenko","year":"2012","journal-title":"Bioinformatics"},{"issue":"21","key":"10.3233\/IFS-151994_ref55","doi-asserted-by":"crossref","first-page":"2669","DOI":"10.1093\/bioinformatics\/btt476","article-title":"The masurca genome assembler","volume":"29","author":"Zimin","year":"2013","journal-title":"Bioinformatics"},{"issue":"3","key":"10.3233\/IFS-151994_ref56","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.bbrc.2012.08.101","article-title":"An efficient algorithm for {DNA} fragment assembly in mapreduce","volume":"426","author":"Xu","year":"2012","journal-title":"Biochemical and Biophysical Research Communications"},{"key":"10.3233\/IFS-151994_ref57","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/ICSGRC.2013.6653277","article-title":"Design and development of DNA fragment assembly using iwp method","author":"Hassan","year":"2013","journal-title":"In Control and System Graduate Research Colloquium (ICSGRC), 2013 IEEE 4th"},{"issue":"3","key":"10.3233\/IFS-151994_ref58","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1109\/TFUZZ.2008.924342","article-title":"Improving generalization of fuzzy if\u2013 then rules by maximizing fuzzy entropy","volume":"17","author":"Wang","year":"2009","journal-title":"Fuzzy Systems, IEEE Transactions on"},{"issue":"5","key":"10.3233\/IFS-151994_ref59","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TEVC.2011.2160399","article-title":"DNA sequence compression using adaptive particle swarm optimization-based memetic algorithm","volume":"15","author":"Zhu","year":"2011","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"9","key":"10.3233\/IFS-151994_ref60","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1007\/s00500-012-0824-6","article-title":"Dynamic ensemble extreme learning machine based on sample entropy","volume":"16","author":"Zhai","year":"2012","journal-title":"Soft {{Computing"},{"issue":"13","key":"10.3233\/IFS-151994_ref61","doi-asserted-by":"crossref","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","article-title":"GSA: A gravitational search algorithm","volume":"179","author":"Rashedi","year":"2009","journal-title":"Information Sciences"},{"key":"10.3233\/IFS-151994_ref62","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","article-title":"Particle swarm optimization","volume":"4","author":"Kennedy","year":"1995","journal-title":"In IEEE International Conference on Neural Networks"},{"issue":"3","key":"10.3233\/IFS-151994_ref63","doi-asserted-by":"crossref","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","article-title":"A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem","volume":"177","author":"Fatih Tasgetiren","year":"2007","journal-title":"European Journal of Operational Research"},{"key":"10.3233\/IFS-151994_ref64","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"Glover","year":"1997"},{"key":"10.3233\/IFS-151994_ref65","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.3233\/IFS-151994_ref66","volume-title":"The Selfish Gene","author":"Dawkins","year":"1976"},{"key":"10.3233\/IFS-151994_ref67","unstructured":"Moscato P. , On evolution, search, optimization, genetic algorithms and martial arts - towards memetic algorithms, 1989."},{"key":"10.3233\/IFS-151994_ref68","unstructured":"Moscato P. and Cotta C. , A gentle introduction to memetic algorithms, 57 (2003), 105\u2013144."},{"key":"10.3233\/IFS-151994_ref69","unstructured":"Krasnogor N. , Arag\u00f3n A. and Pacheco J. , Memetic algorithms, 36 (2006), 225\u2013248."},{"key":"10.3233\/IFS-151994_ref70","unstructured":"Alimehr L. , The performance of sequence alignment algorithms. Master\u2019s thesis, Uppsala University, Department of Information Technology, 2013."},{"issue":"6","key":"10.3233\/IFS-151994_ref71","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equation of state calculations by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"The Journal of Chemical Physics"},{"issue":"1-2","key":"10.3233\/IFS-151994_ref72","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF00993377","article-title":"Genetic algorithms, operators, and DNA fragment assembly","volume":"21","author":"Parsons","year":"1995","journal-title":"Machine Learning"},{"issue":"8","key":"10.3233\/IFS-151994_ref73","doi-asserted-by":"crossref","first-page":"4116","DOI":"10.1016\/j.csda.2008.01.022","article-title":"Sequence alignment for masquerade detection","volume":"52","author":"Coull","year":"2008","journal-title":"Computational Statistics & Data Analysis"},{"key":"10.3233\/IFS-151994_ref74","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.amc.2013.12.175","article-title":"Gravitational search algorithm combined with chaos for unconstrained numerical optimization","volume":"231","author":"Gao","year":"2014","journal-title":"Applied Mathematics and Computation"},{"issue":"8","key":"10.3233\/IFS-151994_ref75","doi-asserted-by":"crossref","first-page":"1589","DOI":"10.1016\/j.engappai.2012.01.011","article-title":"A modified gravitational search algorithm for slope stability analysis","volume":"25","author":"Khajehzadeh","year":"2012","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"1","key":"10.3233\/IFS-151994_ref76","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1006\/geno.1993.1180","article-title":"Artificially generated data sets for testing DNA sequence assembly algorithms","volume":"16","author":"Engle","year":"1993","journal-title":"Genomics"},{"key":"10.3233\/IFS-151994_ref77","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","article-title":"A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms","volume":"1","author":"Derrac","year":"2011","journal-title":"Swarm and Evolutionary Computation"}],"container-title":["Journal of Intelligent & Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IFS-151994","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:39:45Z","timestamp":1777455585000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IFS-151994"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,10]]},"references-count":76,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.3233\/ifs-151994","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,10]]}}}