{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:30Z","timestamp":1763468130325},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,8,8]],"date-time":"2013-08-08T00:00:00Z","timestamp":1375920000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s10100-013-0321-8","type":"journal-article","created":{"date-parts":[[2013,8,7]],"date-time":"2013-08-07T13:04:22Z","timestamp":1375880662000},"page":"567-589","source":"Crossref","is-referenced-by-count":12,"title":["Unified encoding for hyper-heuristics with application to bioinformatics"],"prefix":"10.1007","volume":"22","author":[{"given":"Aleksandra","family":"Swiercz","sequence":"first","affiliation":[]},{"given":"Edmund K.","family":"Burke","sequence":"additional","affiliation":[]},{"given":"Mateusz","family":"Cichenski","sequence":"additional","affiliation":[]},{"given":"Grzegorz","family":"Pawlak","sequence":"additional","affiliation":[]},{"given":"Sanja","family":"Petrovic","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Zurkowski","sequence":"additional","affiliation":[]},{"given":"Jacek","family":"Blazewicz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,8,8]]},"reference":[{"key":"321_CR1","doi-asserted-by":"crossref","unstructured":"Aarts E, Korst J, Michiels W (2005) Simulated annealing. In: search methodologies: introductory tutorials in optimization and decision support, techniques, pp 187\u2013210","DOI":"10.1007\/0-387-28356-0_7"},{"issue":"6","key":"321_CR2","first-page":"569","volume":"3","author":"ZH Ahmed","year":"2010","unstructured":"Ahmed ZH (2010) A lexisearch algorithm for the bottleneck traveling salesman problem. Int J Comput Sci Secur 3(6):569\u2013577","journal-title":"Int J Comput Sci Secur"},{"key":"321_CR3","doi-asserted-by":"crossref","unstructured":"Bai R, Kendall G (2005) An investigation of automated planograms using a simulated annealing based hyper-heuristic. In: Metaheuristics: progress as real problem solvers operations research\/computer science interfaces series, vol 32, pp 87\u2013108","DOI":"10.1007\/0-387-25383-1_4"},{"key":"321_CR4","first-page":"151","volume":"13","author":"J Blazewicz","year":"1997","unstructured":"Blazewicz J, Kaczmarek J, Kasprzak M, Markiewicz W, Weglarz J (1997) Sequential and parallel algorithms for DNA sequencing. CABiOS 13:151\u2013158","journal-title":"CABiOS"},{"key":"321_CR5","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1093\/bioinformatics\/18.5.652","volume":"18","author":"J Blazewicz","year":"2002","unstructured":"Blazewicz J, Formanowicz P, Guinand F, Kasprzak M (2002) A heuristic managing errors for DNA sequencing. Bioinformatics 18:652\u2013660","journal-title":"Bioinformatics"},{"key":"321_CR6","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1016\/S0304-3975(02)00063-4","volume":"290","author":"J Blazewicz","year":"2003","unstructured":"Blazewicz J, Kasprzak M (2003) Complexity of DNA sequencing by hybrydization. Theor Comput Sci 290:1459\u20131473","journal-title":"Theor Comput Sci"},{"issue":"3","key":"321_CR7","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1287\/ijoc.1030.0049","volume":"16","author":"J Blazewicz","year":"2004","unstructured":"Blazewicz J, Glover F, Kasprzak M (2004) DNA sequencing\u2014tabu and scatter search combined. INFORMS J Comput 16(3):232\u2013240","journal-title":"INFORMS J Comput"},{"issue":"5","key":"321_CR8","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.compbiolchem.2006.05.002","volume":"30","author":"J Blazewicz","year":"2006","unstructured":"Blazewicz J, Glover F, Swiercz A, Kasprzak M, Markiewicz W, Oguz C, Rebholz-Schuhmann D (2006a) Dealing with repetitions in sequencing by hybridization. Comput Biol Chem 30(5):313\u2013320","journal-title":"Comput Biol Chem"},{"key":"321_CR9","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1287\/opre.1060.0324","volume":"54","author":"J Blazewicz","year":"2006","unstructured":"Blazewicz J, Oguz C, Swiercz A, Weglarz J (2006b) DNA sequencing by hybridization via genetic search. Oper Res 54:1185\u20131192","journal-title":"Oper Res"},{"key":"321_CR10","doi-asserted-by":"crossref","unstructured":"Blazewicz J, Burke EK, Kendall G, Mruczkiewicz W, Oguz C, Swiercz A (2011) A hyper-heuristic approach to sequencing by hybridization of DNA sequences. Ann Oper Res, pp 1\u201315. doi: 10.1007\/s10479-011-0927-y","DOI":"10.1007\/s10479-011-0927-y"},{"key":"321_CR11","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1007\/978-3-540-24855-2_104","volume":"3103","author":"T Bui","year":"2004","unstructured":"Bui T, Youssef W (2004) An enhanced genetic algorithm for DNA sequencing by hybrydization with positive and negative errors. Lect Notes Comput Sci 3103:908\u2013919","journal-title":"Lect Notes Comput Sci"},{"key":"321_CR12","doi-asserted-by":"crossref","unstructured":"Burke EK, Gendreau M, Hyde M, Kendall G, Ochoa G, \u00d6zcan E, Qu R (2013) Hyper-heuristics: a survey of the state of the art. Journal of the Operational Research Society (10 July 2013), Palgrave Macmillan","DOI":"10.1057\/jors.2013.71"},{"key":"321_CR13","doi-asserted-by":"crossref","unstructured":"Burke EK, Hyde M, Kendall G, Ochoa G, \u00d6zcan E, Woodward JR (2010) A classification of hyper-heuristic approaches. In: Gendreau M, Potvin JY (eds) Handbook of meta-heuristics, vol 146. Springer, International series in operations research and management science, pp 449\u2013468","DOI":"10.1007\/978-1-4419-1665-5_15"},{"key":"321_CR14","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"EK Burke","year":"2003","unstructured":"Burke EK, Kendall G, Soubeiga E (2003b) A tabu-search hyperheuristic for timetabling and rostering. J Heuristics 9:451\u2013470","journal-title":"J Heuristics"},{"key":"321_CR15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"EK Burke","year":"2007","unstructured":"Burke EK, McCollum B, Meisels A, Petrovic S, Qu R (2007) A graph-based hyper-heuristic for timetabling problems. Eur J Oper Res 176:177\u2013192","journal-title":"Eur J Oper Res"},{"key":"321_CR16","doi-asserted-by":"crossref","unstructured":"Burke E, Kendall G, Newall J, Hart E, Ross P, Schulenburg S (2003a) Hyper-heuristics: an emerging direction in modern search technology. In: Handbook of metaheuristics, international series in operations research and management science, vol 57. Springer, New York, chap 16, pp 457\u2013474. doi: 10.1007\/0-306-48056-5_16","DOI":"10.1007\/0-306-48056-5_16"},{"key":"321_CR17","unstructured":"Chaves AA, Lorena LAN (2008) Hybrid metaheuristic for the prize collecting travelling salesman problem. In: Proceedings of the 8th European conference on evolutionary computation in combinatorial optimization. Springer-Verlag, Berlin, Heidelberg, EvoCOP\u201908, pp 123\u2013134. http:\/\/dl.acm.org\/citation.cfm?id=1792634.1792645"},{"key":"321_CR18","unstructured":"Cichowicz T, Drozdowski M, Frankiewicz M, Pawlak G, Rytwi\u0144nski F, Wasilewski J (2012) Five phase and genetic hive hyper-heuristics for the cross-domain search. In: Lecture notes in computer science 7219. Springer 2012, pp 354\u2013359"},{"key":"321_CR19","doi-asserted-by":"crossref","unstructured":"Cichowicz T, Drozdowski M, Frankiewicz M, Pawlak G, Rytwi\u0144nski F, Wasilewski J (2012) Hyper-heuristics for cross-domain search. In: Bulletion of the Polish Academy of Sciences. Technical Sciences 60(4):801\u2013808","DOI":"10.2478\/v10175-012-0093-7"},{"key":"321_CR20","doi-asserted-by":"crossref","unstructured":"Cowling P, Kendall G, Soubeiga E (2001) A hyperheuristic approach to scheduling a sales summit. In: PATAT \u201900: selected papers from the third international conference on practice and theory of automated timetabling III. Springer-Verlag, London, UK, vol 2079, pp 176\u2013190. http:\/\/portal.acm.org\/citation.cfm?id=646431.692903","DOI":"10.1007\/3-540-44629-X_11"},{"key":"321_CR21","unstructured":"Cowling P, Kendall G, Soubeiga E (2002a) Choice function and random hyperheuristics. In: Proceedings of the fourth Asia-Pacific conference on simulated evolution and learning, SEAL, Springer, pp 667\u2013671"},{"key":"321_CR22","doi-asserted-by":"crossref","unstructured":"Cowling P, Kendall G, Soubeiga E (2002b) Hyperheuristics: a tool for rapid prototyping in scheduling and optimisation. In: Proceedings of the applications of evolutionary computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM\/EvoPLAN, Springer-Verlag, London, UK, pp 1\u201310. http:\/\/dl.acm.org\/citation.cfm?id=645407.652005","DOI":"10.1007\/3-540-46004-7_1"},{"key":"321_CR23","unstructured":"Croes GA (1958) A method for solving traveling-salesman problem. In: Operations Research. INFORMS 6:791\u2013812"},{"key":"321_CR24","doi-asserted-by":"crossref","unstructured":"Dowsland KA (1998) Off-the-peg or made-to-measure? Timetabling and scheduling with SA and TS. In: Selected papers from the second international conference on practice and theory of automated timetabling II. Springer-Verlag, London, UK, PATAT \u201997, pp 37\u201352. http:\/\/dl.acm.org\/citation.cfm?id=646430.692896","DOI":"10.1007\/BFb0055880"},{"key":"321_CR25","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.ejor.2005.03.058","volume":"179","author":"K Dowsland","year":"2007","unstructured":"Dowsland K, Soubeiga E, Burke EK (2007) A simulated annealing hyper-heuristic for determining shipper sizes. Eur J Oper Res 179:759\u2013774","journal-title":"Eur J Oper Res"},{"key":"321_CR26","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0888-7543(89)90290-5","volume":"4","author":"R Dramanac","year":"1989","unstructured":"Dramanac R, Labat I, Brukner I, Crkvenjakov R (1989) Sequencing of megabase plus DNA by hybrydization: theory of the method. Genomics 4:114\u2013128","journal-title":"Genomics"},{"key":"321_CR27","doi-asserted-by":"crossref","unstructured":"Gendrau M, Potvin JY (2005) Tabu search. In: Search methodologies: introductory tutorials in optimization and decision support, techniques, pp 165\u2013186","DOI":"10.1007\/0-387-28356-0_6"},{"key":"321_CR28","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 Academic Publishers, Norwell"},{"key":"321_CR29","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Proceedings of a symposium on the complexity of computer computations, the IBM research symposia series. Plenum Press, New York, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"321_CR30","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/11593577_16","volume":"3616","author":"G Kendall","year":"2005","unstructured":"Kendall G, Hussin NM (2005) A tabu search hyper-heuristic approach to the examination timetabling problem at the MARA University of Technology. Lect Notes Comput Sci 3616:270\u2013293","journal-title":"Lect Notes Comput Sci"},{"key":"321_CR31","doi-asserted-by":"crossref","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science, Number 4598(13), May 1983, 20, 4598:671\u2013680. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.18.4175","DOI":"10.1126\/science.220.4598.671"},{"issue":"3","key":"321_CR32","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10732-012-9194-6","volume":"18","author":"J Larusic","year":"2012","unstructured":"Larusic J, Punnen AP, Aubanel E (2012) Experimental analysis of heuristics for the bottleneck traveling salesman problem. J Heuristics 18(3):473\u2013503","journal-title":"J Heuristics"},{"key":"321_CR33","unstructured":"Lysov LP, Florent\u2019ev VL, Khorlin AA, Khrapko KR, Shik VV (1988) Determination of the nucleotide sequence of DNA using hybridization with oligonucleotides. A new method. In: Doklady Akademii nauk SSSR, vol 303:1508\u20131511"},{"key":"321_CR34","doi-asserted-by":"crossref","unstructured":"Mersmann O, Bischl B, Bossek J, Trautmann H, Wagner M, Neumann F (2012) Local search and the traveling salesman problem: a feature-based characterization of problem hardness. In: Learning and Intelligent Optimization conference, Microsoft Technology Center, Paris","DOI":"10.1007\/978-3-642-34413-8_9"},{"key":"321_CR35","unstructured":"Mruczkiewicz W (2009) Hyper-heuristics for Sequencing by Hybridisation Problem. Master\u2019s thesis, Poznan University of Technology, Poznan, Poland"},{"key":"321_CR36","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"SB Needleman","year":"1970","unstructured":"Needleman SB, Wunsch CD (1970) A general method applicable to search for similarities of the amino acid sequence of two proteins. J Mol Biol 48:443\u2013453","journal-title":"J Mol Biol"},{"key":"321_CR37","doi-asserted-by":"crossref","unstructured":"\u00d6zcan E, Bilgin B, Korkmaz EE (2008) A comprehensive analysis of hyper-heuristics. Intell Data Anal 12(1):3\u201323. http:\/\/dl.acm.org\/citation.cfm?id=1368027.1368029","DOI":"10.3233\/IDA-2008-12102"},{"issue":"1","key":"321_CR38","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/07391102.1989.10507752","volume":"7","author":"PA Pevzner","year":"1989","unstructured":"Pevzner PA (1989) l-tuple DNA sequencing: computer analysis. J Biomol Struct Dyn 7(1):63\u201373","journal-title":"J Biomol Struct Dyn"},{"key":"321_CR39","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s12597-009-0018-x","volume":"46","author":"R Ramakrishnan","year":"2009","unstructured":"Ramakrishnan R, Sharma P, Punnen A (2009) An efficient heuristic algorithm for the bottleneck traveling salesman problem. OPSEARCH 46:275\u2013288. doi: 10.1007\/s12597-009-0018-x","journal-title":"OPSEARCH"},{"key":"321_CR40","doi-asserted-by":"crossref","unstructured":"Rice JR (1976) The algorithm selection problem. In: Rubinoff M, Yovits MC (eds) Advances in computers, vol 15, Elsevier, pp 65\u2013118. doi: 10.1016\/S0065-2458(08)60520-3","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"321_CR41","doi-asserted-by":"crossref","unstructured":"Ross P (2005) Hyper-heuristics. In: Search methodologies: introductory tutorials in optimization and decision support, techniques, pp 529\u2013556","DOI":"10.1007\/0-387-28356-0_17"},{"key":"321_CR42","doi-asserted-by":"crossref","unstructured":"Ross P, Marin-Bl\u00e1zques JG, Schulenburg S, Hart E (2003) Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyper-heuristics. In: Proceedings of the genetic and evolutionary computation conference, pp 1295\u20131306","DOI":"10.1007\/3-540-45110-2_5"},{"issue":"5","key":"321_CR43","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"K Smith-Miles","year":"2012","unstructured":"Smith-Miles K, Lopes L (2012) Measuring instance difficulty for combinatorial optimization problems. Comput Oper Res 39(5):875\u2013889. doi: 10.1016\/j.cor.2011.07.006","journal-title":"Comput Oper Res"},{"key":"321_CR44","unstructured":"Southern E (1988) United Kingdom Patent Application GB8810400"},{"key":"321_CR45","unstructured":"TSP Lib Benchmark (1995) [on-line] http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/"},{"key":"321_CR46","unstructured":"UKP Knapsack Benchmark (2005) [on-line] http:\/\/download.gna.org\/pyasukp\/"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-013-0321-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-013-0321-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-013-0321-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T02:39:27Z","timestamp":1646275167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-013-0321-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,8]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["321"],"URL":"https:\/\/doi.org\/10.1007\/s10100-013-0321-8","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,8]]}}}