{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T20:27:38Z","timestamp":1744921658388},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137990"},{"type":"electronic","value":"9783642138003"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13800-3_3","type":"book-chapter","created":{"date-parts":[[2010,6,18]],"date-time":"2010-06-18T02:35:53Z","timestamp":1276828553000},"page":"25-36","source":"Crossref","is-referenced-by-count":5,"title":["A Math-Heuristic Algorithm for the DNA Sequencing Problem"],"prefix":"10.1007","author":[{"given":"Marco","family":"Caserta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"3_CR1","first-page":"551","volume":"35","author":"M. Sniedovich","year":"2006","unstructured":"Sniedovich, M., Vo\u00df, S.: The Corridor Method: A Dynamic Programming Inspired Metaheuristic. Control and Cybernetics\u00a035(3), 551\u2013578 (2006)","journal-title":"Control and Cybernetics"},{"volume-title":"Matheuristics: Hybridizing Metaheuristics and Mathematical Programming","year":"2009","key":"3_CR2","unstructured":"Maniezzo, V., St\u00fctzle, T., Vo\u00df, S. (eds.): Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Springer, Berlin (2009)"},{"key":"3_CR3","first-page":"1","volume-title":"Matheuristics: Hybridizing Metaheuristics and Mathematical Programming","author":"M. Caserta","year":"2009","unstructured":"Caserta, M., Vo\u00df, S.: Metaheuristics: Intelligent Problem Solving. In: Maniezzo, V., St\u00fctzle, T., Vo\u00df, S. (eds.) Matheuristics: Hybridizing Metaheuristics and Mathematical Programming, pp. 1\u201338. Springer, Berlin (2009)"},{"issue":"2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.cor.2007.10.014","volume":"36","author":"M. Caserta","year":"2009","unstructured":"Caserta, M., Qui\u00f1onez Rico, E.: A Cross Entropy-Lagrangean Hybrid Algorithm for the Multi-Item Capacitated Lot Sizing Problem with Setup Times. Computers & Operations Research\u00a036(2), 530\u2013548 (2009)","journal-title":"Computers & Operations Research"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1287\/opre.1050.0243","volume":"54","author":"B. Adenso-Diaz","year":"2006","unstructured":"Adenso-Diaz, B., Laguna, M.: Fine-tuning of Algorithms Using Fractional Experimental Designs and Local Search. Operations Research\u00a054, 99\u2013114 (2006)","journal-title":"Operations Research"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/A:1026569813391","volume":"7","author":"S.P. Coy","year":"2000","unstructured":"Coy, S.P., Golden, B.L., Rungen, G.C., Wasil, E.A.: Using Experimental Design to Find Effective Parameter Settings for Heuristics. Journal of Heuristics\u00a07, 77\u201397 (2000)","journal-title":"Journal of Heuristics"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0305-0548(97)00054-3","volume":"25","author":"M.W. Park","year":"1998","unstructured":"Park, M.W., Kim, Y.D.: A Systematic Procedure for Setting Parameters in Simulated Annealing Algorithms. Computers & Operations Research\u00a025(3), 207\u2013217 (1998)","journal-title":"Computers & Operations Research"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1111\/j.1475-3995.1998.tb00117.x","volume":"5","author":"J. Xu","year":"1998","unstructured":"Xu, J., Chiu, S.Y., Glover, F.: Fine-tuning a Tabu Search Algorithm with Statistical Tests. International Transactions in Operational Research\u00a05(3), 233\u2013244 (1998)","journal-title":"International Transactions in Operational Research"},{"issue":"3","key":"3_CR9","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1080\/01966324.1997.10737444","volume":"17","author":"R. Parson","year":"1997","unstructured":"Parson, R., Johnson, M.E.: A Case Study in Experimental Design Applied to Genetic Algorithms with Applications to DNA Sequence Assembly. American Journal of Mathematical and Management Sciences\u00a017(3), 369\u2013396 (1997)","journal-title":"American Journal of Mathematical and Management Sciences"},{"issue":"2","key":"3_CR10","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R. Battiti","year":"1994","unstructured":"Battiti, R., Tecchioli, G.: The Reactive Tabu Search. ORSA Journal on Computing\u00a06(2), 126\u2013140 (1994)","journal-title":"ORSA Journal on Computing"},{"issue":"12","key":"3_CR11","doi-asserted-by":"publisher","first-page":"5463","DOI":"10.1073\/pnas.74.12.5463","volume":"74","author":"F. Sanger","year":"1977","unstructured":"Sanger, F., Nicklen, S., Chase, A.R.: DNA Sequencing with Chain Terminating Inhibitors. Proceedings National Academy of Science\u00a074(12), 5463\u20135468 (1977)","journal-title":"Proceedings National Academy of Science"},{"issue":"5375","key":"3_CR12","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1126\/science.281.5375.363","volume":"281","author":"M. Ronaghi","year":"1998","unstructured":"Ronaghi, M., Uhlzn, M., Nyrzn, P.: DNA SEQUENCING: A Sequencing Method Based on Real-Time Pyrophosphate. Science\u00a0281(5375), 363\u2013365 (1998)","journal-title":"Science"},{"key":"3_CR13","unstructured":"Drmanac, R., Crkvenjakov, R.: Yugoslav Patent Application\u00a0570 (1987)"},{"key":"3_CR14","unstructured":"Southern, E.: United Kingdom Patent Application GB8810400 (1988)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0022-5193(88)80246-7","volume":"135","author":"W. Bains","year":"1988","unstructured":"Bains, W., Smith, G.C.: A Novel Method for Nucleid Acid Sequence Determination. Journal of Theoretical Biology\u00a0135, 303\u2013307 (1988)","journal-title":"Journal of Theoretical Biology"},{"key":"3_CR16","unstructured":"Macevicz, S.C.: International Patent Application PS US8904741 (1989)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-58338-6_64","volume-title":"Mathematical Foundations of Computer Science 1994","author":"P.A. Pevzner","year":"1994","unstructured":"Pevzner, P.A., Lipshutz, R.J.: Towards DNA Sequencing Chips. In: Pr\u00edvara, I., Rovan, B., Ru\u017ei\u010dka, P. (eds.) MFCS 1994. LNCS, vol.\u00a0841, pp. 143\u2013158. Springer, Heidelberg (1994)"},{"key":"3_CR18","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/07391102.1989.10507752","volume":"7","author":"P.A. Pevznev","year":"1989","unstructured":"Pevznev, P.A.: l-tuple DNA Sequencing: Computer Analysis. Journal of Biomolecular Structure and Dynamics\u00a07, 63\u201373 (1989)","journal-title":"Journal of Biomolecular Structure and Dynamics"},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.engappai.2007.03.004","volume":"21","author":"A. Nikolakopoulos","year":"2008","unstructured":"Nikolakopoulos, A., Sarimveis, H.: A Metaheuristic Approach for the Sequencing by Hybridization Problem with Positive and Negative Errors. Engineering Applications of Artificial Intelligence\u00a021(2), 247\u2013258 (2008)","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"6","key":"3_CR20","doi-asserted-by":"publisher","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.: DNA Sequencing by Hybridization via Genetic Search. Operations Research\u00a054(6), 1185\u20131192 (2006)","journal-title":"Operations Research"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1007\/978-3-540-24855-2_104","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"T.N. Bui","year":"2004","unstructured":"Bui, T.N., Youssef, W.A.: An Enhanced Genetic Algorithm for DNA Sequencing by Hybridization with Positive and Negative Errors. In: Deb, K., Poli, R., Banzahf, W., Beyer, H., Burke, E., Darwen, P., Dasgupta, D., Floreano, D., Foster, J., Harman, M., Holland, O., Lanzi, P., Spector, L., Tettamanzi, A., Thierens, D., Tyrrell, A. (eds.) GECCO 2004. LNCS, vol.\u00a03103, pp. 908\u2013919. Springer, Heidelberg (2004)"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0377-2217(99)00456-7","volume":"125","author":"J. Blazewicz","year":"2000","unstructured":"Blazewicz, J., Formanowicz, P., Kasprzak, K., Markiewicz, W.T., Weglarz, J.: Tabu Search for DNA Sequencing with False Negative and False Positive. European Journal of Operational Research\u00a0125, 257\u2013265 (2000)","journal-title":"European Journal of Operational Research"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1016\/S0304-3975(02)00063-4","volume":"290","author":"J. Blazewicz","year":"2003","unstructured":"Blazewicz, J., Kasprzak, M.: Complexity of DNA Sequencing by Hybridization. Theoretical Computer Science\u00a0290, 1459\u20131473 (2003)","journal-title":"Theoretical Computer Science"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1089\/cmb.1999.6.113","volume":"6","author":"J. Blazewicz","year":"1999","unstructured":"Blazewicz, J., Formanovicz, P., Kasprzak, M., Markiewicz, W.T., Weglarz, J.: DNA Sequencing with Positive and Negative Errors. Journal of Computational Biology\u00a06, 113\u2013126 (1999)","journal-title":"Journal of Computational Biology"},{"key":"3_CR25","unstructured":"Caserta, M., Vo\u00df, S.: A Hybrid Algorithm for the DNA Sequencing Problem. Technical report, Institute of Information Systems, University of Hamburg (2009)"},{"issue":"3","key":"3_CR26","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1287\/ijoc.1030.0049","volume":"16","author":"J. Blazewicz","year":"2004","unstructured":"Blazewicz, J., Glover, F., Kasprzak, M.: DNA Sequencing \u2013 Tabu and Scatter Search Combined. INFORMS Journal on Computing\u00a016(3), 232\u2013240 (2004)","journal-title":"INFORMS Journal on Computing"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1023\/A:1016589707123","volume":"8","author":"J. Blazewicz","year":"2002","unstructured":"Blazewicz, J., Kasprzak, M., Kuroczycki, W.: Hybrid Genetic Algorithm for DNA Sequencing with Errors. Journal of Heuristics\u00a08, 495\u2013502 (2002)","journal-title":"Journal of Heuristics"},{"key":"3_CR28","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.compbiolchem.2006.05.002","volume":"30","author":"J. Blazewicz","year":"2006","unstructured":"Blazewicz, J., Glover, F., Kasprzak, K., Markiewicz, W.T., Oguz, C., Rebholz-Schuhmann, D., Swiercz, A.: Dealing with Repetitions in Sequencing by Hybridization. Computational Biology and Chemistry\u00a030, 313\u2013320 (2006)","journal-title":"Computational Biology and Chemistry"},{"issue":"9","key":"3_CR29","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T. Tsiligirides","year":"1984","unstructured":"Tsiligirides, T.: Heuristic Methods Applied to Orienteering. Journal of the Operational Research Society\u00a035(9), 797\u2013809 (1984)","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"3_CR30","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1147\/rd.471.0057","volume":"47","author":"R. Lougee-Heimer","year":"2003","unstructured":"Lougee-Heimer, R.: The Common Optimization INterface for Operations Research. IBM Journal of Research and Development\u00a047(1), 57\u201366 (2003)","journal-title":"IBM Journal of Research and Development"},{"key":"3_CR31","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local Branching. Mathematical Programming\u00a0B 98, 23\u201347 (2003)","journal-title":"Mathematical Programming"},{"key":"3_CR32","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/978-1-4615-5775-3_30","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"P. Hansen","year":"1999","unstructured":"Hansen, P., Mladenovi\u0107, N.: An Introduction to Variable Neighborhood Search. In: Vo\u00df, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 433\u2013458. Kluwer, Boston (1999)"},{"key":"3_CR33","unstructured":"National Center for Biotechnology Information (May 2009), http:\/\/www.ncbi.nlm.nih.gov\/"},{"key":"3_CR34","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S.B. Needelman","year":"1970","unstructured":"Needelman, S.B., Wunsch, C.D.: A General Method Applicable to the Search for Similarities of the Aminoacid Sequence of Two Proteins. Journal of Molecular Biology\u00a048, 443\u2013453 (1970)","journal-title":"Journal of Molecular Biology"},{"key":"3_CR35","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1186\/gb-2004-5-10-r80","volume":"5","author":"C. Gentleman","year":"2004","unstructured":"Gentleman, C., Carey, V.J., Bates, D.M., Bolstad, B., Dettling, M., Dudoit, S., Ellis, B., Gautier, L., Ge, Y., Gentry, J., Hornik, K., Hothorn, T., Huber, W., Iacus, S., Irizarry, R., Leisch, F., Li, C., Maechler, M., Rossini, A.J., Sawitzki, G., Smith, C., Smyth, G., Tierney, L., Yang, J.Y.H., Zhang, J.: Bioconductor: Open Software Development for Computational Biology and Bioinformatics. Genome Biology\u00a05, R80 (2004)","journal-title":"Genome Biology"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13800-3_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:43:45Z","timestamp":1606167825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13800-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137990","9783642138003"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13800-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}