{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:25:11Z","timestamp":1743063911988,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642348587"},{"type":"electronic","value":"9783642348594"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34859-4_19","type":"book-chapter","created":{"date-parts":[[2012,11,30]],"date-time":"2012-11-30T04:44:23Z","timestamp":1354250663000},"page":"188-197","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Two-Phase Ant Colony Optimization Algorithm for the Closest String Problem"],"prefix":"10.1007","author":[{"given":"Hoang Xuan","family":"Huan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong Do","family":"Duc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen Manh","family":"Ha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"suppl. 1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1186\/1471-2105-12-S1-S55","volume":"12","author":"C. Boucher","year":"2011","unstructured":"Boucher, C., Ma, B.: Closest String with Outliers. BMC Bioinformatics\u00a012(suppl. 1), S55 (2011)","journal-title":"BMC Bioinformatics"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-31265-6_34","volume-title":"Combinatorial Pattern Matching","author":"C. Boucher","year":"2012","unstructured":"Boucher, C., Landau, G.M., Levy, A., Pritchard, D., Weimann, O.: On Approximating String Selection Problems with Outliers. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol.\u00a07354, pp. 427\u2013438. Springer, Heidelberg (2012)"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MCI.2010.936309","volume":"5","author":"X.S. Chen","year":"2010","unstructured":"Chen, X.S., Ong, Y.S., Lim, M.H.: Research Frontier: Memetic Computation - Past, Present & Future. IEEE Computational Intelligence Magazine\u00a05(2), 24\u201336 (2010)","journal-title":"IEEE Computational Intelligence Magazine"},{"issue":"5","key":"19_CR4","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/TEVC.2011.2132725","volume":"15","author":"X.S. Chen","year":"2011","unstructured":"Chen, X.S., Ong, Y.S., Lim, M.H., Tan, K.C.: A Multi-Facet Survey on Memetic Computation. IEEE Transactions on Evolutionary Computation\u00a015(5), 591\u2013607 (2011)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.jcss.2011.01.003","volume":"78","author":"Z.Z. Chen","year":"2012","unstructured":"Chen, Z.Z., Ma, B., Wang, L.: A three-string approach to the closest string problem. J. Comput. Syst. Sci.\u00a078(1), 164\u2013178 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1109\/TCBB.2011.21","volume":"8","author":"Z.Z. Chen","year":"2011","unstructured":"Chen, Z.Z., Wang, L.: Fast Exact Algorithms for the Closest String and Substring Problems with Applicationto the Planted (L. d)-Motif Model. IEEE\/ACM Transaction on Computational Biology and Bioinformatics\u00a08(5), 1400\u20131410 (2011)","journal-title":"IEEE\/ACM Transaction on Computational Biology and Bioinformatics"},{"key":"19_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-89674-6_18","volume-title":"Intelligent Agents and Multi-Agent Systems","author":"D. Do Duc","year":"2008","unstructured":"Do Duc, D., Dinh, H.Q., Hoang Xuan, H.: On the Pheromone Update Rules of Ant Colony Optimization Approaches for the Job Shop Scheduling Problem. In: Bui, T.D., Ho, T.V., Ha, Q.T. (eds.) PRIMA 2008. LNCS (LNAI), vol.\u00a05357, pp. 153\u2013160. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Do Duc, D., Hoang Xuan, H.: ACOHAP: A novel Ant Colony Optimization algorithm for haplotype inference problem. In: Proc. of the Third International Conference on Knowledge and Systems Engineering (KSE 2011), pp. 128\u2013134 (2011)","key":"19_CR8","DOI":"10.1109\/KSE.2011.27"},{"unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: An autocatalytic optimizing process. Technical Report 91-016 Revised, Dipartimento di Elettronica, Politecnico di Milano, Milano, Italy (1991)","key":"19_CR9"},{"key":"19_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"Dorigo, M., Stutzle, T.: Ant Colony Optimization. The MIT Press, Cambridge (2004)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-11266-9_31","volume-title":"SOFSEM 2010: Theory and Practice of Computer Science","author":"S. Faro","year":"2010","unstructured":"Faro, S., Pappalardo, E.: Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorn\u00fd, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol.\u00a05901, pp. 370\u2013381. Springer, Heidelberg (2010)"},{"issue":"2","key":"19_CR12","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"},{"unstructured":"Gasieniec, L., Jansson, J., Lingas, A.: Effcient approximation algorithms for the Hamming center problem. In: Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp. 905\u2013906 (1999)","key":"19_CR13"},{"key":"19_CR14","first-page":"441","volume-title":"Proc. of the 12th International Symposium on Algorithms and Computation","author":"J. Gramm","year":"2001","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Exact solutions for Closest String and related problems. In: Proc. of the 12th International Symposium on Algorithms and Computation, pp. 441\u2013453. Springer, London (2001)"},{"doi-asserted-by":"crossref","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica, 25\u201342 (2003)","key":"19_CR15","DOI":"10.1007\/s00453-003-1028-3"},{"issue":"2","key":"19_CR16","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.: Identication of consensus patterns in unaligned DNA sequences known to be functionally related. Bioinformatics\u00a06(2), 81\u201392 (1990)","journal-title":"Bioinformatics"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"J.K. Lanctot","year":"2003","unstructured":"Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing String Selection Problems. Information and Computation\u00a0185, 41\u201355 (2003)","journal-title":"Information and Computation"},{"issue":"2","key":"19_CR18","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"},{"issue":"4","key":"19_CR19","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1137\/080739069","volume":"39","author":"B. Ma","year":"2009","unstructured":"Ma, B., Sun, X.: More Efficient Algorithms for Closest String and Substring Problems. SIAM J. Comput.\u00a039(4), 1432\u20131443 (2009)","journal-title":"SIAM J. Comput."},{"unstructured":"Moscato, P.: On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. Tech. Rep.Caltech Concurrent Computation Program, Report. 826, California Institute of Technology, Pasadena, California, USA (1989)","key":"19_CR20"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-31265-6_33","volume-title":"Combinatorial Pattern Matching","author":"L.P. Dinu","year":"2012","unstructured":"Dinu, L.P., Popa, A.: On the Closest String via Rank Distance. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol.\u00a07354, pp. 413\u2013426. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34859-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T20:50:17Z","timestamp":1675284617000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-34859-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642348587","9783642348594"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34859-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}