{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:25:23Z","timestamp":1761488723834},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,7,6]],"date-time":"2011-07-06T00:00:00Z","timestamp":1309910400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10479-011-0927-y","type":"journal-article","created":{"date-parts":[[2011,7,5]],"date-time":"2011-07-05T10:44:41Z","timestamp":1309862681000},"page":"27-41","source":"Crossref","is-referenced-by-count":14,"title":["A hyper-heuristic approach to sequencing by hybridization of DNA sequences"],"prefix":"10.1007","volume":"207","author":[{"given":"Jacek","family":"Blazewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edmund K.","family":"Burke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Graham","family":"Kendall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Mruczkiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ceyda","family":"Oguz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandra","family":"Swiercz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,7,6]]},"reference":[{"key":"927_CR1","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/0-387-28356-0_7","volume-title":"Search methodologies: introductory tutorials in optimization and decision support techniques","author":"E. Aarts","year":"2005","unstructured":"Aarts, E., Korst, J., & Michiels, W. (2005). Simulated annealing. In E. K. Burke & G. Kendall (Eds.), Search methodologies: introductory tutorials in optimization and decision support techniques (pp.\u00a0187\u2013210). Berlin: Springer. Chap.\u00a07."},{"key":"927_CR2","first-page":"132","volume-title":"Placement machine","author":"M. Ayob","year":"2003","unstructured":"Ayob, M., & Kendall, G. (2003). A Monte Carlo hyper-heuristic to optimise component placement sequencing for multi head placement machine. In Placement machine, InTech\u201903 Thailand (pp. 132\u2013141)."},{"key":"927_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/0-387-25383-1_4","volume-title":"Metaheuristics: progress as real problem solvers operations research\/computer science interfaces series","author":"R. Bai","year":"2005","unstructured":"Bai, R., & Kendall, G. (2005). An investigation of automated planograms using a simulated annealing based hyper-heuristics. In T. Ibaraki, K. Nonobe, & M. Yagiura (Eds.), Metaheuristics: progress as real problem solvers operations research\/computer science interfaces series (Vol. 32, pp. 87\u2013108). Berlin: Springer."},{"key":"927_CR4","unstructured":"Bai, R., Blazewicz, J., Burke, E. K., Kendall, G., & Mccollum, B. (2007). A simulated annealing hyper-heuristic methodology for flexible decision support (Tech. rep.). School of CSiT. University of Nottingham, UK."},{"issue":"3","key":"927_CR5","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 hybridization. Theoretical Computer Science, 290(3), 1459\u20131473.","journal-title":"Theoretical Computer Science"},{"key":"927_CR6","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0377-2217(99)00456-7","volume":"125","author":"J. Blazewicz","year":"2000","unstructured":"Blazewicz, J., Formanowicz, P., Kasprzak, M., Markiewicz, W., & Weglarz, J. (2000). Tabu search for DNA sequencing with false negative and false positives. European Journal of Operational Research, 125, 257\u2013265.","journal-title":"European Journal of Operational Research"},{"key":"927_CR7","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. (2002a). A heuristic managing errors for DNA sequencing. Bioinformatics, 18, 652\u2013660.","journal-title":"Bioinformatics"},{"key":"927_CR8","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1023\/A:1016589707123","volume":"8","author":"J. Blazewicz","year":"2002","unstructured":"Blazewicz, J., Kasprzak, M., & Kuroczycki, W. (2002b). Hybrid genetic algorithm for DNA sequencing with errors. Journal of Heuristics, 8, 495\u2013502.","journal-title":"Journal of Heuristics"},{"key":"927_CR9","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 Journal on Computing, 16, 232\u2013240.","journal-title":"INFORMS Journal on Computing"},{"issue":"5","key":"927_CR10","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. (2006). Dealing with repetitions in sequencing by hybridization. Computational Biology and Chemistry, 30(5), 313\u2013320.","journal-title":"Computational Biology and Chemistry"},{"key":"927_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 hybridization with positive and negative errors. Lecture Notes in Computer Science, 3103, 908\u2013919.","journal-title":"Lecture Notes in Computer Science"},{"key":"927_CR12","volume-title":"Search methodologies: introductory tutorials in optimization and decision support techniques","year":"2005","unstructured":"Burke, E. K., & Kendall, G. (Eds.) (2005). Search methodologies: introductory tutorials in optimization and decision support techniques. Berlin: Springer."},{"key":"927_CR13","first-page":"197","volume-title":"Proceedings of the 1st multidisciplinary international conference on scheduling: theory and applications (MISTA 2003)","author":"E. K. Burke","year":"2003","unstructured":"Burke, E. K., & Soubeiga, E. (2003). Scheduling nurses using a tabu-search hyperheuristic. In Proceedings of the 1st multidisciplinary international conference on scheduling: theory and applications (MISTA 2003), 197\u2013218."},{"key":"927_CR14","volume-title":"Handbook of metaheuristics","author":"E. Burke","year":"2003","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. Dordrecht: Kluwer Academic. Chap.\u00a016."},{"issue":"6","key":"927_CR15","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"E. K. Burke","year":"2003","unstructured":"Burke, E. K., Kendall, G., & Soubeiga, E. (2003b). A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics, 9(6), 451\u2013470.","journal-title":"Journal of Heuristics"},{"issue":"1","key":"927_CR16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"E. K. Burke","year":"2007","unstructured":"Burke, E. K., McCollum, B., Meisels, A., Petrovic, S., & Qu, R. (2007). A graph-based hyper-heuristic for timetabling problems. European Journal of Operational Research, 176(1), 177\u2013192.","journal-title":"European Journal of Operational Research"},{"key":"927_CR17","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume-title":"PATAT \u201900: Selected papers from the third international conference on practice and theory of automated timetabling III","author":"P. Cowling","year":"2001","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 (pp. 176\u2013190). London: Springer."},{"key":"927_CR18","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-46004-7_1","volume-title":"EvoWorkShops","author":"P. Cowling","year":"2002","unstructured":"Cowling, P., Kendall, G., & Soubeiga, E. (2002). Hyperheuristics: A tool for rapid prototyping in scheduling and optimisation. In: Lecture notes in computer science, EvoWorkShops, pp.\u00a01\u201310. Berlin: Springer."},{"issue":"3","key":"927_CR19","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, E.K (2007). A simulated annealing hyper-heuristic for determining shipper sizes. European Journal of Operational Research 179(3), 759\u2013774.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"927_CR20","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 hybridization: Theory of the method. Genomics, 4(2), 114\u2013128.","journal-title":"Genomics"},{"key":"927_CR21","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/0-387-28356-0_6","volume-title":"Search methodologies: introductory tutorials in optimization and decision support techniques","author":"M. Gendreau","year":"2005","unstructured":"Gendreau, M., & Potvin, J. Y. (2005). Tabu search. In: E. K. Burke & G. Kendall (Eds.), Search methodologies: introductory tutorials in optimization and decision support techniques (pp.\u00a0165\u2013186). Berlin: Springer. Chap.\u00a06."},{"key":"927_CR22","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. Boston: Kluwer Academic."},{"key":"927_CR23","first-page":"2230","volume-title":"Proceedings of congress on evolutionary computation (CEC2003)","author":"L. Han","year":"2003","unstructured":"Han, L., & Kendall, G. (2003). Investigation of a tabu assisted hyper-heuristic genetic algorithm. In Proceedings of congress on evolutionary computation (CEC2003) (Vol.\u00a03, pp.\u00a02230\u20132237)."},{"key":"927_CR24","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/11593577_16","volume":"3616","author":"G. Kendall","year":"2005","unstructured":"Kendall, G., & Hussin, M. (2005a). A tabu search hyper-heuristic approach to the examination timetabling problem at the MARA University of Technology. Lectures Notes in Computer Science, 3616, 270\u2013293.","journal-title":"Lectures Notes in Computer Science"},{"key":"927_CR25","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/0-387-27744-7_15","volume-title":"An investigation of a tabu-search-based hyper-heuristic for examination timetabling, multidisciplinary scheduling; theory and applications","author":"G. Kendall","year":"2005","unstructured":"Kendall, G., & Hussin, N. M. (2005b). In G. Kendall, E. Burke, S. Petrovic, & M. Gendreau (Eds.), An investigation of a tabu-search-based hyper-heuristic for examination timetabling, multidisciplinary scheduling; theory and applications (pp.\u00a0309\u2013328). Berlin: Springer."},{"key":"927_CR26","first-page":"667","volume-title":"Proceedings of the 4th Asia-Pacific conference on simulated evolution and learning (SEAL\u201902)","author":"G. Kendall","year":"2002","unstructured":"Kendall, G., Soubeiga, E., & Cowling, P. (2002). Choice function and random hyperheuristics. In Proceedings of the 4th Asia-Pacific conference on simulated evolution and learning (SEAL\u201902) (pp.\u00a0667\u2013671)."},{"key":"927_CR27","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, C.D., & Vecchi, M.P. (1983). Optimization by simulated annealing. Science, 220, 671\u2013680.","journal-title":"Science"},{"key":"927_CR28","first-page":"1508","volume":"303","author":"I.P. Lysov","year":"1988","unstructured":"Lysov, I.P., Florent\u2019ev, V.L., Khorlin, A.A., Khrapko, K.R., & Shik, V.V. (1988). Determination of the nucleotide sequence of DNA using hybridization with oligonucleotides. A new method. Doklady Akademii Nauk SSSR, 303, 1508\u20131511.","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"927_CR29","unstructured":"Mruczkiewicz, W. (2009). Hyper-heuristics for sequencing by hybridisation problem. Master Thesis, Poznan University of Technology, Poland."},{"key":"927_CR30","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S. B. Needleman","year":"1970","unstructured":"Needleman, S. B., Wunsch, C.D. (1970). A general method applicable to the search for similarities of the amino acid sequence of two proteins. Journal of Molecular Biology 48, 443\u2013453.","journal-title":"Journal of Molecular Biology"},{"key":"927_CR31","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/07391102.1989.10507752","volume":"7","author":"P. A. Pevzner","year":"1989","unstructured":"Pevzner, P. A. (1989). 1-tuple DNA sequencing: computer analysis. Journal of Biomolecular Structure and Dynamics, 7, 63\u201373.","journal-title":"Journal of Biomolecular Structure and Dynamics"},{"key":"927_CR32","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/0-387-28356-0_17","volume-title":"Search methodologies: introductory tutorials in optimization and decision support techniques","author":"P. Ross","year":"2005","unstructured":"Ross, P. (2005). Hyper-heuristics. In E. K. Burke & G. Kendall (Eds.), Search methodologies: introductory tutorials in optimization and decision support techniques (pp.\u00a0529\u2013556). Berlin: Springer. Chap.\u00a017."},{"key":"927_CR33","first-page":"1295","volume-title":"Proceedings of the genetic and evolutionary computation conference","author":"P. Ross","year":"2003","unstructured":"Ross, P., Marin-Bl\u00e1zquez, J. G., 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). Berlin: Springer."},{"key":"927_CR34","unstructured":"Southern, E. (1988). United Kingdom Patent Application GB8810400."},{"issue":"1","key":"927_CR35","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1093\/bioinformatics\/19.1.14","volume":"19","author":"J. H. Zhang","year":"2003","unstructured":"Zhang, J. H., LY, Wu, & Zhang, X. S. (2003). Reconstruction of DNA sequencing by hybridization. Bioinformatics, 19(1), 14\u201321.","journal-title":"Bioinformatics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0927-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0927-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0927-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T19:10:27Z","timestamp":1560366627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0927-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,6]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["927"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0927-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,6]]}}}