{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:00:11Z","timestamp":1725897611123},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387029"},{"type":"electronic","value":"9783642387036"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38703-6_36","type":"book-chapter","created":{"date-parts":[[2013,5,13]],"date-time":"2013-05-13T16:18:03Z","timestamp":1368461883000},"page":"306-313","source":"Crossref","is-referenced-by-count":7,"title":["Solving the Minimum Common String Partition Problem with the Help of Ants"],"prefix":"10.1007","author":[{"given":"S. M.","family":"Ferdous","sequence":"first","affiliation":[]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"36_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"Dorigo, M., Di Caro, G., Gambardella, M.L.: Ant algorithms for discrete optimization. J. of Artificial Life\u00a05(2), 137\u2013172 (1999)","journal-title":"J. of Artificial Life"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Gambardella, M.L.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. J. of IEEE Transactions on Evolutionary Computation\u00a01 (1996)","DOI":"10.1109\/4235.585892"},{"issue":"9","key":"36_CR3","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. Stuetzle","year":"2000","unstructured":"Stuetzle, T., Hoos, H.H.: MAX-MIN Ant System. J. of Future Gener. Comput. System\u00a016(9), 889\u2013914 (2000)","journal-title":"J. of Future Gener. Comput. System"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0022-5193(82)90384-8","volume":"99","author":"G.A. Watterson","year":"1982","unstructured":"Watterson, G.A., Ewens, W.J., Hall, T.E., Morgan, A.: The chromosome inversion problem. Journal of Theoretical Biology\u00a099, 7 (1982)","journal-title":"Journal of Theoretical Biology"},{"key":"36_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-30551-4_43","volume-title":"Algorithms and Computation","author":"A. Goldstein","year":"2004","unstructured":"Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partition problem: Hardness and approximations. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 484\u2013495. Springer, Heidelberg (2004)"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement (2004) (submitted)","DOI":"10.1142\/9781860947322_0037"},{"key":"36_CR7","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-87361-7_8","volume-title":"Algorithms in Bioinformatics","author":"P. Damaschke","year":"2008","unstructured":"Damaschke, P.: Minimum Common String Partition Parameterized. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol.\u00a05251, pp. 87\u201398. Springer, Heidelberg (2008)"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-27821-4_8","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Chrobak","year":"2004","unstructured":"Chrobak, M., Kolman, P., Sgall, J.: The greedy algorithm for the minimum common string partition problem. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX and RANDOM 2004. LNCS, vol.\u00a03122, pp. 84\u201395. Springer, Heidelberg (2004)"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-14553-7_7","volume-title":"Frontiers in Algorithmics","author":"H. Jiang","year":"2010","unstructured":"Jiang, H., Zhu, B., Zhu, D., Zhu, H.: Minimum common string partition revisited. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol.\u00a06213, pp. 45\u201352. Springer, Heidelberg (2010)"},{"key":"36_CR10","doi-asserted-by":"crossref","first-page":"1102","DOI":"10.2144\/00286ir01","volume":"28","author":"P. Stothard","year":"2000","unstructured":"Stothard, P.: The Sequence Manipulation Suite: JavaScript programs for analyzing and formatting protein and DNA sequences. Biotechniques\u00a028, 1102\u20131104 (2000)","journal-title":"Biotechniques"},{"key":"36_CR11","unstructured":"Villesen, P.: FaBox: an online fasta sequence toolbox (2007), \n                    \n                      http:\/\/www.birc.au.dk\/software\/fabox"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38703-6_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T01:05:21Z","timestamp":1557709521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38703-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387029","9783642387036"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38703-6_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}