{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:11:54Z","timestamp":1725541914101},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112652"},{"type":"electronic","value":"9783642112669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_31","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T09:04:58Z","timestamp":1260176698000},"page":"370-381","source":"Crossref","is-referenced-by-count":9,"title":["Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem"],"prefix":"10.1007","author":[{"given":"Simone","family":"Faro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elisa","family":"Pappalardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0004-3702(89)90050-7","volume":"40","author":"L.B. Booker","year":"1989","unstructured":"Booker, L.B., Goldberg, D.E., Holland, J.H.: Classifier Systems and Genetic Algorithms. Artif. Intell.\u00a040(1-3), 235\u2013282 (1989)","journal-title":"Artif. Intell."},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF01417909","volume":"3","author":"J.L. Deneubourg","year":"1990","unstructured":"Deneubourg, J.L., Aron, S., Goss, S., Pasteels, J.M.: The Self-Organizing Exploratory Pattern of the Argentine Ant. Journal of Insect Behavior\u00a03(2), 159\u2013168 (1990)","journal-title":"Journal of Insect Behavior"},{"key":"31_CR3","unstructured":"Dorigo, M.: Optimization, Learning and Natural Algorithms. PhD Thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy (1992)"},{"issue":"2","key":"31_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant Algorithms for Discrete Optimization. Artificial Life\u00a05(2), 137\u2013172 (1999)","journal-title":"Artificial Life"},{"issue":"2","key":"31_CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M. Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On Covering Problems of Codes. Theory of Computing Systems\u00a030(2), 113\u2013119 (1997)","journal-title":"Theory of Computing Systems"},{"key":"31_CR6","first-page":"905","volume-title":"Proceedings of the 10th\u00a0Annual ACM-SIAM Symposium on Discrete Algorithms","author":"L. Gasieniec","year":"1999","unstructured":"Gasieniec, L., Jansson, J., Lingas, A.: Efficient Approximation Algorithms for the Hamming Center Problem. In: Proceedings of the 10th\u00a0Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 905\u2013906. Society for Industrial and Applied Mathematics, Philadelphia (1999)"},{"issue":"2","key":"31_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1022602019183","volume":"3","author":"D.E. Goldberg","year":"1988","unstructured":"Goldberg, D.E., Holland, J.H.: Genetic Algorithms and Machine Learning. Machine Learning\u00a03(2), 95\u201399 (1988)","journal-title":"Machine Learning"},{"issue":"11","key":"31_CR8","doi-asserted-by":"publisher","first-page":"3636","DOI":"10.1016\/j.cor.2007.04.002","volume":"35","author":"F.C. Gomes","year":"2008","unstructured":"Gomes, F.C., Meneses, C.N., Pardalos, P.M., Viana, G.V.R.: A Parallel Multistart Algorithm for the Closest String Problem. Computers and Operations Research\u00a035(11), 3636\u20133643 (2008)","journal-title":"Computers and Operations Research"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-45678-3_38","volume-title":"Algorithms and Computation","author":"J. Gramm","year":"2001","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Exact Solutions for Closest String and Related Problems. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 441\u2013453. Springer, Heidelberg (2001)"},{"issue":"1","key":"31_CR10","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.: Fixed-Parameter Algorithms for Closest String and Related Problems. Algorithmica\u00a037(1), 25\u201342 (2003)","journal-title":"Algorithmica"},{"issue":"2","key":"31_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1093\/bioinformatics\/6.2.81","volume":"6","author":"G.Z. Hertz","year":"1990","unstructured":"Hertz, G.Z., Hartzell, G.W., Stormo, G.D.: Identification of Consensus Patterns in Unaligned DNA Sequences Known to Be Functionally Related. Bioinformatics\u00a06(2), 81\u201392 (1990)","journal-title":"Bioinformatics"},{"key":"31_CR12","volume-title":"Approximation algorithms for NP-hard problems","author":"D.S. Hochba","year":"1997","unstructured":"Hochba, D.S.: Approximation algorithms for NP-hard problems, vol.\u00a028. ACM, New York (1997)"},{"key":"31_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1992","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. MIT Press, Cambridge (1992)"},{"key":"31_CR14","unstructured":"Holland, J.H.: Genetic Algorithms Computer Programs that \u201cEvolve\u201d in Ways that Resemble Natural Selection Can Solve Complex Problems even Their Creators Do not Fully Understand. Scientific American 267, 62\u201372 (1992)"},{"issue":"4598","key":"31_CR15","doi-asserted-by":"publisher","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.: Optimization by Simulated Annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"31_CR16","first-page":"633","volume-title":"Proceedings of the 10th\u00a0Annual ACM-SIAM Symposium on Discrete Algorithms","author":"J.K. Lanctot","year":"1999","unstructured":"Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing String Selection Problems. In: Proceedings of the 10th\u00a0Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 633\u2013642. Society for Industrial and Applied Mathematics, Philadelphia (1999)"},{"issue":"2","key":"31_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/506147.506150","volume":"49","author":"M. Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: On the Closest String and Substring Problems. Journal of the ACM\u00a049(2), 157\u2013171 (2002)","journal-title":"Journal of the ACM"},{"key":"31_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/11527503_70","volume-title":"Advanced Data Mining and Applications","author":"X. Liu","year":"2005","unstructured":"Liu, X., He, H., Sykora, O.: Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem. In: Li, X., Wang, S., Dong, Z.Y. (eds.) ADMA 2005. LNCS (LNAI), vol.\u00a03584, pp. 591\u2013597. Springer, Heidelberg (2005)"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Liu, X., Holger, M., Hao, Z., Wu, G.: A Compounded Genetic and Simulated Annealing Algorithm for the Closest String Problem. In: 2nd\u00a0International Conference on Bioinformatics and Biomedical Engineering, ICBBE\u00a02008, pp. 702\u2013705 (2008)","DOI":"10.1109\/ICBBE.2008.171"},{"key":"31_CR20","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-540-78839-3_33","volume-title":"Research in Computational Molecular Biology","author":"B. Ma","year":"2008","unstructured":"Ma, B., Sun, X.: More Efficient Algorithms for Closest String and Substring Problems. In: Vingron, M., Wong, L. (eds.) RECOMB 2008. LNCS (LNBI), vol.\u00a04955, pp. 396\u2013409. Springer, Heidelberg (2008)"},{"issue":"4","key":"31_CR21","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/ijoc.1040.0090","volume":"16","author":"C.N. Meneses","year":"2004","unstructured":"Meneses, C.N., Lu, Z., Oliveira, C.A.S., Pardalos, P.M.: Optimal Solutions for the Closest-String Problem via Integer Programming. Informs Journal on Computing\u00a016(4), 419\u2013429 (2004)","journal-title":"Informs Journal on Computing"},{"key":"31_CR22","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N. Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.E., Rosenbluth, M.N., Teller, A.H., Teller, E.: Perspective on Equation of State Calculations by Fast Computing Machines. J. Chem. Phys.\u00a021, 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"issue":"247","key":"31_CR23","doi-asserted-by":"publisher","first-page":"335","DOI":"10.2307\/2280232","volume":"44","author":"N. Metropolis","year":"1949","unstructured":"Metropolis, N., Ulam, S.: The Monte Carlo Method. Journal of the American Statistical Association\u00a044(247), 335\u2013341 (1949)","journal-title":"Journal of the American Statistical Association"},{"key":"31_CR24","volume-title":"Coding and information theory","author":"S. Roman","year":"1992","unstructured":"Roman, S.: Coding and information theory. Springer, Heidelberg (1992)"},{"key":"31_CR25","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1073\/pnas.86.4.1183","volume":"86","author":"G.D. Stormo","year":"1989","unstructured":"Stormo, G.D., Hartzell, G.W.: Identifying Protein-Binding Sites from Unaligned DNA Fragments. Proc. Natl. Acad. Sci. USA\u00a086, 1183\u20131187 (1989)","journal-title":"Proc. Natl. Acad. Sci. USA"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T18:37:04Z","timestamp":1552243024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}