{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:09:08Z","timestamp":1725988148069},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319071237"},{"type":"electronic","value":"9783319071244"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-07124-4_58","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T19:09:59Z","timestamp":1534187399000},"page":"1221-1240","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Selected String Problems"],"prefix":"10.1007","author":[{"given":"Christian","family":"Blum","sequence":"first","affiliation":[]},{"given":"Paola","family":"Festa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"58_CR1","doi-asserted-by":"crossref","unstructured":"Blum C, Festa P (2014) A hybrid ant colony optimization algorithm for the far from most string problem. In: Proceedings of the 14th European conference on evolutionary computation in combinatorial optimisation (EvoCOP2014). Lecture notes in computer science, vol 8600. Springer, Berlin, pp 1\u201312","DOI":"10.1007\/978-3-662-44320-0_1"},{"key":"58_CR2","doi-asserted-by":"crossref","unstructured":"Boucher C, Landau G, Levy A, Pritchard D, Weimann O (2013) On approximating string selection problems with outliers. Theor Comput Sci 498:107\u2013114","DOI":"10.1016\/j.tcs.2013.05.037"},{"key":"58_CR3","doi-asserted-by":"crossref","unstructured":"Croce FD, Garraffa M (2014) The selective fixing algorithm for the closest string problem. Comput Oper Res 41:24\u201330","DOI":"10.1016\/j.cor.2013.07.017"},{"key":"58_CR4","doi-asserted-by":"crossref","unstructured":"Croce FD, Salassa F (2012) Improved lp-based algorithms for the closest string problem. Comput Oper Res 39:746\u2013749","DOI":"10.1016\/j.cor.2011.06.010"},{"key":"58_CR5","doi-asserted-by":"crossref","unstructured":"Ferone D, Festa P, Resende M (2013) Hybrid metaheuristics for the far from most string problem. In: Proceedings of 8th international workshop on hybrid metaheuristics. Lecture notes in computer science, vol 7919. Springer, Berlin, pp 174\u2013188","DOI":"10.1007\/978-3-642-38516-2_14"},{"key":"58_CR6","doi-asserted-by":"crossref","unstructured":"Festa P (2007) On some optimization problems in molecular biology. Math Biosci 207(2): 219\u2013234","DOI":"10.1016\/j.mbs.2006.11.012"},{"key":"58_CR7","doi-asserted-by":"crossref","unstructured":"Frances M, Litman A (1997) On covering problems of codes. Theory Comput Syst 30(2): 113\u2013119","DOI":"10.1007\/BF02679443"},{"key":"58_CR8","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Reading, Massachusetts, Addison-Wesley"},{"key":"58_CR9","unstructured":"Gramm J (2003) Fixed-parameter algorithms for the consensus analysis of genomic data. Eberhard Karls University of T\u00fcbingen, PhD thesis"},{"key":"58_CR10","unstructured":"Gramm J, H\u00fcffner F, Niedermeier R (2002) Closest strings, primer design, and motif search. In: Sixth annual international conference on computational molecular biology, Washington, DC, pp 74\u201375"},{"key":"58_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-003-1028-3","volume":"37","author":"J Gramm","year":"2003","unstructured":"Gramm J, Niedermeier R, Rossmanith P (2003) Fixed-parameter algorithms for closest string and related problems. Algorithmica 37:25\u201342","journal-title":"Algorithmica"},{"key":"58_CR12","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. Cambridge, Massachusetts, MIT Press"},{"issue":"5\u20136","key":"58_CR13","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1007\/BF01009452","volume":"34","author":"S Kirkpatrick","year":"1984","unstructured":"Kirkpatrick S (1984) Optimization by simulated annealing: quantitative studies. J Stat Phys 34(5\u20136):975\u2013986","journal-title":"J Stat Phys"},{"key":"58_CR14","unstructured":"Lanctot J (2004) Some string problems in computational biology. University of Waterloo, PhD thesis"},{"key":"58_CR15","unstructured":"Lanctot J, Li M, Ma B, Wang S, Zhang L (1999) Distinguishing string selection problems. In: Proceedings of the annual ACM-SIAM symposium on discrete aLgorithms (SODA), Baltimore, pp 633\u2013642"},{"issue":"1","key":"58_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"J Lanctot","year":"2003","unstructured":"Lanctot J, Li M, Ma B, Wang S, Zhang L (2003) Distinguishing string selection problems. Inf Comput 185(1):41\u201355","journal-title":"Inf Comput"},{"key":"58_CR17","doi-asserted-by":"crossref","unstructured":"Li M, Ma B, Wang L (1999) Finding similar regions in many strings. In: ACM symposium on theory of computing (STOC\u201999), New York, pp 473\u2013482","DOI":"10.1145\/301250.301376"},{"key":"58_CR18","doi-asserted-by":"crossref","unstructured":"Liu X, He H, S\u00fdkora O (2005) Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem. In: Proceedings of ADMA 2005. Lecture notes in artificial intelligence, vol 3584. Springer, Berlin Heidelberg New York, pp 591\u2013597","DOI":"10.1007\/11527503_70"},{"issue":"11","key":"58_CR19","doi-asserted-by":"publisher","first-page":"1513","DOI":"10.1016\/j.cor.2011.01.009","volume":"38","author":"X Liu","year":"2011","unstructured":"Liu X, Liu S, Hao Z, Mauch H (2011) Exact algorithm and heuristic for the closest string problem. Comput Oper Res 38(11):1513\u20131520","journal-title":"Comput Oper Res"},{"key":"58_CR20","doi-asserted-by":"crossref","unstructured":"Ma B, Sun X (2008) More efficient algorithms for closest string and substring problems. Lecture notes in computer science, vol 4955. Springer, Berlin, pp 396\u2013409","DOI":"10.1007\/978-3-540-78839-3_33"},{"volume-title":"Gene probes for bacteria","year":"1990","key":"58_CR21","unstructured":"Macario A, de Macario EC (eds) (1990) Gene probes for bacteria. Academic Press, San Diego"},{"issue":"3","key":"58_CR22","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/MEMB.2005.1436464","volume":"24","author":"C Meneses","year":"2005","unstructured":"Meneses C, Oliveira C, Pardalos P (2005) Optimization techniques for string selection and comparison problems in genomics. IEEE Eng Med Biol Mag 24(3):81\u201387","journal-title":"IEEE Eng Med Biol Mag"},{"key":"58_CR23","unstructured":"Meneses C, Pardalos P, Resende M, Vazacopoulos A (2005) Modeling and solving string selection problems. In: Proceedings of the 2005 international symposium on mathematical and computational biology (BIOMAT 2005), pp 55\u201365"},{"issue":"6","key":"58_CR24","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21(6):1087\u20131092","journal-title":"J Chem Phys"},{"key":"58_CR25","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10732-011-9177-z","volume":"18","author":"S Mousavi","year":"2012","unstructured":"Mousavi S, Babaie M, Montazerian M (2012) An improved heuristic for the far from most strings problem. J Heuristics 18:239\u2013262","journal-title":"J Heuristics"},{"key":"58_CR26","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/ijoc.1040.0090","volume":"16","author":"P Pardalos","year":"2004","unstructured":"Pardalos P, Oliveira C, Lu Z, Meneses C (2004) Optimal solutions for the closest string problem via integer programming. INFORMS J Comput 16:419\u2013429","journal-title":"INFORMS J Comput"},{"key":"58_CR27","unstructured":"Roman S (1992) Coding and information theory. Graduate texts in mathematics, vol 134. Springer, New York"},{"key":"58_CR28","unstructured":"Sim J, Park K (1999) The consensus string problem for a metric is NP-complete. In: Proceedings of the annual Australasian workshop on combinatorial algorithms (AWOCA), pp 107\u2013113"},{"key":"58_CR29","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1016\/j.cor.2011.06.005","volume":"39","author":"S Tanaka","year":"2012","unstructured":"Tanaka S (2012) A heuristic algorithm based on Lagrangian relaxation for the closest string problem. Comput Oper Res 39:709\u2013717","journal-title":"Comput Oper Res"},{"key":"58_CR30","doi-asserted-by":"crossref","unstructured":"Wang L, Zhu B (2009) Efficient algorithms for the closest string and distinguishing string selection problems. Lecture notes in computer science, vol 5598. Springer, Berlin, pp 261\u2013270","DOI":"10.1007\/978-3-642-02270-8_27"},{"issue":"12","key":"58_CR31","doi-asserted-by":"publisher","first-page":"5609","DOI":"10.1016\/j.apm.2011.05.015","volume":"35","author":"P Z\u00f6rnig","year":"2011","unstructured":"Z\u00f6rnig P (2011) Improved optimization modelling for the closest string and related problems. Appl Math Modell 35(12):5609\u20135617","journal-title":"Appl Math Modell"},{"issue":"8","key":"58_CR32","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1089\/cmb.2014.0265","volume":"22","author":"P Z\u00f6rnig","year":"2015","unstructured":"Z\u00f6rnig P (2015) Reduced-size integer linear programming models for string selection problems: application to the farthest string problem. J Comput Biol 22(8):729\u2013742","journal-title":"J Comput Biol"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T07:23:29Z","timestamp":1571729009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_58","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}